./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_tso.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_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4babe4290f8db56d203694af79af85036014557c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:04:28,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:04:28,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:04:28,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:04:28,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:04:28,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:04:28,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:04:28,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:04:28,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:04:28,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:04:28,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:04:28,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:04:28,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:04:28,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:04:28,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:04:28,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:04:28,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:04:28,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:04:28,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:04:28,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:04:28,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:04:28,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:04:28,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:04:28,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:04:28,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:04:28,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:04:28,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:04:28,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:04:28,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:04:28,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:04:28,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:04:28,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:04:28,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:04:28,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:04:28,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:04:28,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:04:28,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:04:28,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:04:28,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:04:28,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:04:28,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:04:28,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:04:28,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:04:28,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:04:28,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:04:28,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:04:28,983 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:04:28,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:04:28,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:04:28,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:04:28,984 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:04:28,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:04:28,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:04:28,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:04:28,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:04:28,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:04:28,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:04:28,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:04:28,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer 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 -> Automizer 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 -> 4babe4290f8db56d203694af79af85036014557c [2019-12-07 12:04:29,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:04:29,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:04:29,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:04:29,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:04:29,098 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:04:29,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix036_tso.opt.i [2019-12-07 12:04:29,135 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/data/8ddfdff27/ed1ffb60c0b140c696fdc44b17e0fabc/FLAG38ec2f182 [2019-12-07 12:04:29,615 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:04:29,615 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/sv-benchmarks/c/pthread-wmm/mix036_tso.opt.i [2019-12-07 12:04:29,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/data/8ddfdff27/ed1ffb60c0b140c696fdc44b17e0fabc/FLAG38ec2f182 [2019-12-07 12:04:29,635 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/data/8ddfdff27/ed1ffb60c0b140c696fdc44b17e0fabc [2019-12-07 12:04:29,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:04:29,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:04:29,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:04:29,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:04:29,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:04:29,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:04:29" (1/1) ... [2019-12-07 12:04:29,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:29, skipping insertion in model container [2019-12-07 12:04:29,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:04:29" (1/1) ... [2019-12-07 12:04:29,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:04:29,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:04:29,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:04:29,934 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:04:29,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:04:30,025 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:04:30,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30 WrapperNode [2019-12-07 12:04:30,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:04:30,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:04:30,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:04:30,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:04:30,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:04:30,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:04:30,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:04:30,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:04:30,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... [2019-12-07 12:04:30,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:04:30,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:04:30,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:04:30,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:04:30,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:04:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:04:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:04:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:04:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:04:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:04:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:04:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:04:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:04:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:04:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:04:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 12:04:30,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 12:04:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:04:30,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:04:30,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:04:30,141 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:04:30,486 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:04:30,486 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:04:30,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:04:30 BoogieIcfgContainer [2019-12-07 12:04:30,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:04:30,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:04:30,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:04:30,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:04:30,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:04:29" (1/3) ... [2019-12-07 12:04:30,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ae38bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:04:30, skipping insertion in model container [2019-12-07 12:04:30,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:04:30" (2/3) ... [2019-12-07 12:04:30,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ae38bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:04:30, skipping insertion in model container [2019-12-07 12:04:30,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:04:30" (3/3) ... [2019-12-07 12:04:30,491 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_tso.opt.i [2019-12-07 12:04:30,497 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:04:30,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:04:30,502 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:04:30,502 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:04:30,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,539 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,539 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,539 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:04:30,555 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 12:04:30,567 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:04:30,567 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:04:30,567 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:04:30,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:04:30,568 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:04:30,568 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:04:30,568 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:04:30,568 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:04:30,579 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-07 12:04:30,580 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-07 12:04:30,631 INFO L134 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-07 12:04:30,631 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:04:30,640 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 12:04:30,652 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-07 12:04:30,677 INFO L134 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-07 12:04:30,677 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:04:30,681 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 12:04:30,692 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 12:04:30,693 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:04:33,548 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 12:04:33,781 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 12:04:33,916 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48496 [2019-12-07 12:04:33,917 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-07 12:04:33,919 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-07 12:04:35,181 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26302 states. [2019-12-07 12:04:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states. [2019-12-07 12:04:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:04:35,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:35,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:35,188 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash -887935004, now seen corresponding path program 1 times [2019-12-07 12:04:35,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:35,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853096967] [2019-12-07 12:04:35,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:35,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853096967] [2019-12-07 12:04:35,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:35,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:04:35,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895165531] [2019-12-07 12:04:35,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:35,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:35,368 INFO L87 Difference]: Start difference. First operand 26302 states. Second operand 3 states. [2019-12-07 12:04:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:35,704 INFO L93 Difference]: Finished difference Result 25630 states and 112008 transitions. [2019-12-07 12:04:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:35,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:04:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:35,901 INFO L225 Difference]: With dead ends: 25630 [2019-12-07 12:04:35,901 INFO L226 Difference]: Without dead ends: 24142 [2019-12-07 12:04:35,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24142 states. [2019-12-07 12:04:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24142 to 24142. [2019-12-07 12:04:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24142 states. [2019-12-07 12:04:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24142 states to 24142 states and 105356 transitions. [2019-12-07 12:04:36,761 INFO L78 Accepts]: Start accepts. Automaton has 24142 states and 105356 transitions. Word has length 9 [2019-12-07 12:04:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:36,762 INFO L462 AbstractCegarLoop]: Abstraction has 24142 states and 105356 transitions. [2019-12-07 12:04:36,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24142 states and 105356 transitions. [2019-12-07 12:04:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:04:36,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:36,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:36,768 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1247749362, now seen corresponding path program 1 times [2019-12-07 12:04:36,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:36,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648231971] [2019-12-07 12:04:36,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:36,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648231971] [2019-12-07 12:04:36,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:36,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:36,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093200032] [2019-12-07 12:04:36,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:36,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:36,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:36,831 INFO L87 Difference]: Start difference. First operand 24142 states and 105356 transitions. Second operand 4 states. [2019-12-07 12:04:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:37,197 INFO L93 Difference]: Finished difference Result 36454 states and 153868 transitions. [2019-12-07 12:04:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:37,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:04:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:37,453 INFO L225 Difference]: With dead ends: 36454 [2019-12-07 12:04:37,453 INFO L226 Difference]: Without dead ends: 36394 [2019-12-07 12:04:37,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36394 states. [2019-12-07 12:04:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36394 to 33062. [2019-12-07 12:04:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-07 12:04:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 141336 transitions. [2019-12-07 12:04:38,324 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 141336 transitions. Word has length 15 [2019-12-07 12:04:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:38,324 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 141336 transitions. [2019-12-07 12:04:38,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 141336 transitions. [2019-12-07 12:04:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:04:38,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:38,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:38,329 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1635073164, now seen corresponding path program 1 times [2019-12-07 12:04:38,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:38,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992017250] [2019-12-07 12:04:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:38,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992017250] [2019-12-07 12:04:38,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:38,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:38,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111213861] [2019-12-07 12:04:38,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:38,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:38,366 INFO L87 Difference]: Start difference. First operand 33062 states and 141336 transitions. Second operand 3 states. [2019-12-07 12:04:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:38,678 INFO L93 Difference]: Finished difference Result 41522 states and 174636 transitions. [2019-12-07 12:04:38,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:38,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:04:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:38,764 INFO L225 Difference]: With dead ends: 41522 [2019-12-07 12:04:38,764 INFO L226 Difference]: Without dead ends: 41522 [2019-12-07 12:04:38,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41522 states. [2019-12-07 12:04:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41522 to 35834. [2019-12-07 12:04:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35834 states. [2019-12-07 12:04:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35834 states to 35834 states and 152544 transitions. [2019-12-07 12:04:39,526 INFO L78 Accepts]: Start accepts. Automaton has 35834 states and 152544 transitions. Word has length 18 [2019-12-07 12:04:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:39,526 INFO L462 AbstractCegarLoop]: Abstraction has 35834 states and 152544 transitions. [2019-12-07 12:04:39,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 35834 states and 152544 transitions. [2019-12-07 12:04:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:04:39,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:39,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:39,531 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:39,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1634952543, now seen corresponding path program 1 times [2019-12-07 12:04:39,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:39,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711020846] [2019-12-07 12:04:39,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:39,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711020846] [2019-12-07 12:04:39,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:39,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:39,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551776031] [2019-12-07 12:04:39,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:39,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:39,698 INFO L87 Difference]: Start difference. First operand 35834 states and 152544 transitions. Second operand 4 states. [2019-12-07 12:04:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:39,969 INFO L93 Difference]: Finished difference Result 43266 states and 181176 transitions. [2019-12-07 12:04:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:39,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:04:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:40,071 INFO L225 Difference]: With dead ends: 43266 [2019-12-07 12:04:40,071 INFO L226 Difference]: Without dead ends: 43226 [2019-12-07 12:04:40,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43226 states. [2019-12-07 12:04:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43226 to 37670. [2019-12-07 12:04:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37670 states. [2019-12-07 12:04:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37670 states to 37670 states and 159820 transitions. [2019-12-07 12:04:40,993 INFO L78 Accepts]: Start accepts. Automaton has 37670 states and 159820 transitions. Word has length 18 [2019-12-07 12:04:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:40,993 INFO L462 AbstractCegarLoop]: Abstraction has 37670 states and 159820 transitions. [2019-12-07 12:04:40,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37670 states and 159820 transitions. [2019-12-07 12:04:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:04:40,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:40,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:40,997 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1770652005, now seen corresponding path program 1 times [2019-12-07 12:04:40,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:40,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836712442] [2019-12-07 12:04:40,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:41,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836712442] [2019-12-07 12:04:41,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:41,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:41,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863348137] [2019-12-07 12:04:41,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:41,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:41,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:41,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:41,035 INFO L87 Difference]: Start difference. First operand 37670 states and 159820 transitions. Second operand 4 states. [2019-12-07 12:04:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:41,320 INFO L93 Difference]: Finished difference Result 47658 states and 200116 transitions. [2019-12-07 12:04:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:41,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:04:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:41,424 INFO L225 Difference]: With dead ends: 47658 [2019-12-07 12:04:41,424 INFO L226 Difference]: Without dead ends: 47598 [2019-12-07 12:04:41,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47598 states. [2019-12-07 12:04:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47598 to 39262. [2019-12-07 12:04:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39262 states. [2019-12-07 12:04:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39262 states to 39262 states and 166916 transitions. [2019-12-07 12:04:42,392 INFO L78 Accepts]: Start accepts. Automaton has 39262 states and 166916 transitions. Word has length 18 [2019-12-07 12:04:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:42,392 INFO L462 AbstractCegarLoop]: Abstraction has 39262 states and 166916 transitions. [2019-12-07 12:04:42,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39262 states and 166916 transitions. [2019-12-07 12:04:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:04:42,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:42,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:42,400 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1431333081, now seen corresponding path program 1 times [2019-12-07 12:04:42,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:42,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480385865] [2019-12-07 12:04:42,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:42,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480385865] [2019-12-07 12:04:42,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:42,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:42,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978523605] [2019-12-07 12:04:42,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:42,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:42,434 INFO L87 Difference]: Start difference. First operand 39262 states and 166916 transitions. Second operand 3 states. [2019-12-07 12:04:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:42,585 INFO L93 Difference]: Finished difference Result 37206 states and 156212 transitions. [2019-12-07 12:04:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:42,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:04:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:42,670 INFO L225 Difference]: With dead ends: 37206 [2019-12-07 12:04:42,670 INFO L226 Difference]: Without dead ends: 37206 [2019-12-07 12:04:42,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37206 states. [2019-12-07 12:04:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37206 to 36326. [2019-12-07 12:04:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36326 states. [2019-12-07 12:04:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36326 states to 36326 states and 152780 transitions. [2019-12-07 12:04:43,570 INFO L78 Accepts]: Start accepts. Automaton has 36326 states and 152780 transitions. Word has length 20 [2019-12-07 12:04:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:43,570 INFO L462 AbstractCegarLoop]: Abstraction has 36326 states and 152780 transitions. [2019-12-07 12:04:43,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36326 states and 152780 transitions. [2019-12-07 12:04:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:04:43,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:43,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] [2019-12-07 12:04:43,576 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1560525539, now seen corresponding path program 1 times [2019-12-07 12:04:43,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:43,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175986700] [2019-12-07 12:04:43,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:43,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175986700] [2019-12-07 12:04:43,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:43,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:04:43,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688535683] [2019-12-07 12:04:43,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:43,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:43,633 INFO L87 Difference]: Start difference. First operand 36326 states and 152780 transitions. Second operand 3 states. [2019-12-07 12:04:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:43,784 INFO L93 Difference]: Finished difference Result 36359 states and 152515 transitions. [2019-12-07 12:04:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:43,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:04:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:43,857 INFO L225 Difference]: With dead ends: 36359 [2019-12-07 12:04:43,858 INFO L226 Difference]: Without dead ends: 36359 [2019-12-07 12:04:43,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36359 states. [2019-12-07 12:04:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36359 to 36207. [2019-12-07 12:04:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36207 states. [2019-12-07 12:04:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36207 states to 36207 states and 152151 transitions. [2019-12-07 12:04:44,570 INFO L78 Accepts]: Start accepts. Automaton has 36207 states and 152151 transitions. Word has length 20 [2019-12-07 12:04:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:44,570 INFO L462 AbstractCegarLoop]: Abstraction has 36207 states and 152151 transitions. [2019-12-07 12:04:44,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36207 states and 152151 transitions. [2019-12-07 12:04:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:04:44,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:44,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:44,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1326592186, now seen corresponding path program 1 times [2019-12-07 12:04:44,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:44,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488295983] [2019-12-07 12:04:44,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:44,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488295983] [2019-12-07 12:04:44,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:44,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:44,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218963372] [2019-12-07 12:04:44,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:44,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:44,608 INFO L87 Difference]: Start difference. First operand 36207 states and 152151 transitions. Second operand 4 states. [2019-12-07 12:04:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:44,676 INFO L93 Difference]: Finished difference Result 12537 states and 41384 transitions. [2019-12-07 12:04:44,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:44,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:04:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:44,697 INFO L225 Difference]: With dead ends: 12537 [2019-12-07 12:04:44,698 INFO L226 Difference]: Without dead ends: 12537 [2019-12-07 12:04:44,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2019-12-07 12:04:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 12537. [2019-12-07 12:04:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12537 states. [2019-12-07 12:04:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12537 states to 12537 states and 41384 transitions. [2019-12-07 12:04:44,885 INFO L78 Accepts]: Start accepts. Automaton has 12537 states and 41384 transitions. Word has length 21 [2019-12-07 12:04:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:44,885 INFO L462 AbstractCegarLoop]: Abstraction has 12537 states and 41384 transitions. [2019-12-07 12:04:44,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 12537 states and 41384 transitions. [2019-12-07 12:04:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:04:44,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:44,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:44,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1129864970, now seen corresponding path program 1 times [2019-12-07 12:04:44,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:44,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715278971] [2019-12-07 12:04:44,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:44,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715278971] [2019-12-07 12:04:44,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:44,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:44,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182694719] [2019-12-07 12:04:44,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:44,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:44,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:44,922 INFO L87 Difference]: Start difference. First operand 12537 states and 41384 transitions. Second operand 5 states. [2019-12-07 12:04:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:44,951 INFO L93 Difference]: Finished difference Result 3260 states and 10051 transitions. [2019-12-07 12:04:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:44,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 12:04:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:44,955 INFO L225 Difference]: With dead ends: 3260 [2019-12-07 12:04:44,955 INFO L226 Difference]: Without dead ends: 3260 [2019-12-07 12:04:44,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2019-12-07 12:04:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3260. [2019-12-07 12:04:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3260 states. [2019-12-07 12:04:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 10051 transitions. [2019-12-07 12:04:44,988 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 10051 transitions. Word has length 22 [2019-12-07 12:04:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:44,988 INFO L462 AbstractCegarLoop]: Abstraction has 3260 states and 10051 transitions. [2019-12-07 12:04:44,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 10051 transitions. [2019-12-07 12:04:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:04:44,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:44,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:44,992 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash 808807491, now seen corresponding path program 1 times [2019-12-07 12:04:44,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:44,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547341221] [2019-12-07 12:04:44,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547341221] [2019-12-07 12:04:45,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:45,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355336458] [2019-12-07 12:04:45,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:45,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:45,042 INFO L87 Difference]: Start difference. First operand 3260 states and 10051 transitions. Second operand 5 states. [2019-12-07 12:04:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:45,168 INFO L93 Difference]: Finished difference Result 4311 states and 12852 transitions. [2019-12-07 12:04:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:04:45,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 12:04:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:45,173 INFO L225 Difference]: With dead ends: 4311 [2019-12-07 12:04:45,173 INFO L226 Difference]: Without dead ends: 4309 [2019-12-07 12:04:45,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-12-07 12:04:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3496. [2019-12-07 12:04:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3496 states. [2019-12-07 12:04:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 10723 transitions. [2019-12-07 12:04:45,216 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 10723 transitions. Word has length 32 [2019-12-07 12:04:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:45,216 INFO L462 AbstractCegarLoop]: Abstraction has 3496 states and 10723 transitions. [2019-12-07 12:04:45,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 10723 transitions. [2019-12-07 12:04:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:04:45,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:45,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:45,220 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 911486793, now seen corresponding path program 1 times [2019-12-07 12:04:45,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:45,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427657403] [2019-12-07 12:04:45,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427657403] [2019-12-07 12:04:45,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:45,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928401479] [2019-12-07 12:04:45,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:45,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:45,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:45,242 INFO L87 Difference]: Start difference. First operand 3496 states and 10723 transitions. Second operand 3 states. [2019-12-07 12:04:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:45,277 INFO L93 Difference]: Finished difference Result 4028 states and 11719 transitions. [2019-12-07 12:04:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:45,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 12:04:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:45,281 INFO L225 Difference]: With dead ends: 4028 [2019-12-07 12:04:45,281 INFO L226 Difference]: Without dead ends: 4028 [2019-12-07 12:04:45,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2019-12-07 12:04:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3476. [2019-12-07 12:04:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-12-07 12:04:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 10243 transitions. [2019-12-07 12:04:45,322 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 10243 transitions. Word has length 32 [2019-12-07 12:04:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:45,322 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 10243 transitions. [2019-12-07 12:04:45,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 10243 transitions. [2019-12-07 12:04:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:04:45,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:45,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:45,327 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:45,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:45,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1231778147, now seen corresponding path program 1 times [2019-12-07 12:04:45,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:45,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013334920] [2019-12-07 12:04:45,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013334920] [2019-12-07 12:04:45,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:45,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315743241] [2019-12-07 12:04:45,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:45,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:45,380 INFO L87 Difference]: Start difference. First operand 3476 states and 10243 transitions. Second operand 5 states. [2019-12-07 12:04:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:45,525 INFO L93 Difference]: Finished difference Result 4081 states and 11776 transitions. [2019-12-07 12:04:45,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:04:45,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:04:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:45,530 INFO L225 Difference]: With dead ends: 4081 [2019-12-07 12:04:45,530 INFO L226 Difference]: Without dead ends: 4079 [2019-12-07 12:04:45,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2019-12-07 12:04:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 3339. [2019-12-07 12:04:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2019-12-07 12:04:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 9858 transitions. [2019-12-07 12:04:45,592 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 9858 transitions. Word has length 33 [2019-12-07 12:04:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:45,592 INFO L462 AbstractCegarLoop]: Abstraction has 3339 states and 9858 transitions. [2019-12-07 12:04:45,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 9858 transitions. [2019-12-07 12:04:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:04:45,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:45,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:45,595 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:45,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:45,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1737281917, now seen corresponding path program 1 times [2019-12-07 12:04:45,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:45,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230913070] [2019-12-07 12:04:45,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230913070] [2019-12-07 12:04:45,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:45,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510379572] [2019-12-07 12:04:45,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:45,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:45,648 INFO L87 Difference]: Start difference. First operand 3339 states and 9858 transitions. Second operand 4 states. [2019-12-07 12:04:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:45,692 INFO L93 Difference]: Finished difference Result 5040 states and 14164 transitions. [2019-12-07 12:04:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:45,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 12:04:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:45,697 INFO L225 Difference]: With dead ends: 5040 [2019-12-07 12:04:45,697 INFO L226 Difference]: Without dead ends: 4704 [2019-12-07 12:04:45,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2019-12-07 12:04:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4253. [2019-12-07 12:04:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4253 states. [2019-12-07 12:04:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 11883 transitions. [2019-12-07 12:04:45,743 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 11883 transitions. Word has length 33 [2019-12-07 12:04:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:45,744 INFO L462 AbstractCegarLoop]: Abstraction has 4253 states and 11883 transitions. [2019-12-07 12:04:45,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 11883 transitions. [2019-12-07 12:04:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:04:45,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:45,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:45,748 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1645195905, now seen corresponding path program 2 times [2019-12-07 12:04:45,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:45,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053043769] [2019-12-07 12:04:45,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053043769] [2019-12-07 12:04:45,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:45,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052756199] [2019-12-07 12:04:45,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:45,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:45,804 INFO L87 Difference]: Start difference. First operand 4253 states and 11883 transitions. Second operand 5 states. [2019-12-07 12:04:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:45,846 INFO L93 Difference]: Finished difference Result 5954 states and 16189 transitions. [2019-12-07 12:04:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:45,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:04:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:45,851 INFO L225 Difference]: With dead ends: 5954 [2019-12-07 12:04:45,851 INFO L226 Difference]: Without dead ends: 3359 [2019-12-07 12:04:45,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2019-12-07 12:04:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3335. [2019-12-07 12:04:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3335 states. [2019-12-07 12:04:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 9696 transitions. [2019-12-07 12:04:45,893 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 9696 transitions. Word has length 33 [2019-12-07 12:04:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:45,893 INFO L462 AbstractCegarLoop]: Abstraction has 3335 states and 9696 transitions. [2019-12-07 12:04:45,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 9696 transitions. [2019-12-07 12:04:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:04:45,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:45,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:45,897 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1430651403, now seen corresponding path program 3 times [2019-12-07 12:04:45,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:45,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238413954] [2019-12-07 12:04:45,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238413954] [2019-12-07 12:04:45,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:45,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532139006] [2019-12-07 12:04:45,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:45,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:45,963 INFO L87 Difference]: Start difference. First operand 3335 states and 9696 transitions. Second operand 4 states. [2019-12-07 12:04:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:46,008 INFO L93 Difference]: Finished difference Result 4721 states and 12748 transitions. [2019-12-07 12:04:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:46,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 12:04:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:46,013 INFO L225 Difference]: With dead ends: 4721 [2019-12-07 12:04:46,013 INFO L226 Difference]: Without dead ends: 4301 [2019-12-07 12:04:46,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-12-07 12:04:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4183. [2019-12-07 12:04:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2019-12-07 12:04:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 11496 transitions. [2019-12-07 12:04:46,063 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 11496 transitions. Word has length 33 [2019-12-07 12:04:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:46,064 INFO L462 AbstractCegarLoop]: Abstraction has 4183 states and 11496 transitions. [2019-12-07 12:04:46,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 11496 transitions. [2019-12-07 12:04:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:04:46,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:46,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:46,069 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1715422791, now seen corresponding path program 4 times [2019-12-07 12:04:46,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:46,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845072463] [2019-12-07 12:04:46,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:46,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845072463] [2019-12-07 12:04:46,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:46,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:04:46,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359602591] [2019-12-07 12:04:46,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:04:46,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:46,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:04:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:46,108 INFO L87 Difference]: Start difference. First operand 4183 states and 11496 transitions. Second operand 6 states. [2019-12-07 12:04:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:46,147 INFO L93 Difference]: Finished difference Result 2891 states and 8543 transitions. [2019-12-07 12:04:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:04:46,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 12:04:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:46,150 INFO L225 Difference]: With dead ends: 2891 [2019-12-07 12:04:46,151 INFO L226 Difference]: Without dead ends: 2549 [2019-12-07 12:04:46,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-12-07 12:04:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2124. [2019-12-07 12:04:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-12-07 12:04:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 6498 transitions. [2019-12-07 12:04:46,175 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 6498 transitions. Word has length 33 [2019-12-07 12:04:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:46,175 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 6498 transitions. [2019-12-07 12:04:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:04:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 6498 transitions. [2019-12-07 12:04:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:04:46,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:46,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:46,178 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash -229481117, now seen corresponding path program 1 times [2019-12-07 12:04:46,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:46,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307230111] [2019-12-07 12:04:46,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:46,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307230111] [2019-12-07 12:04:46,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:46,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:04:46,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120297546] [2019-12-07 12:04:46,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:04:46,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:04:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:46,240 INFO L87 Difference]: Start difference. First operand 2124 states and 6498 transitions. Second operand 6 states. [2019-12-07 12:04:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:46,427 INFO L93 Difference]: Finished difference Result 6002 states and 18243 transitions. [2019-12-07 12:04:46,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:04:46,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 12:04:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:46,433 INFO L225 Difference]: With dead ends: 6002 [2019-12-07 12:04:46,433 INFO L226 Difference]: Without dead ends: 4982 [2019-12-07 12:04:46,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:04:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2019-12-07 12:04:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 2958. [2019-12-07 12:04:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-12-07 12:04:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 8852 transitions. [2019-12-07 12:04:46,477 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 8852 transitions. Word has length 48 [2019-12-07 12:04:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:46,477 INFO L462 AbstractCegarLoop]: Abstraction has 2958 states and 8852 transitions. [2019-12-07 12:04:46,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:04:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 8852 transitions. [2019-12-07 12:04:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:04:46,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:46,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:46,481 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:46,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2084633731, now seen corresponding path program 2 times [2019-12-07 12:04:46,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:46,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229505689] [2019-12-07 12:04:46,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:46,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229505689] [2019-12-07 12:04:46,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:46,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:46,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296526809] [2019-12-07 12:04:46,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:46,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:46,521 INFO L87 Difference]: Start difference. First operand 2958 states and 8852 transitions. Second operand 4 states. [2019-12-07 12:04:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:46,543 INFO L93 Difference]: Finished difference Result 3514 states and 10052 transitions. [2019-12-07 12:04:46,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:46,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 12:04:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:46,546 INFO L225 Difference]: With dead ends: 3514 [2019-12-07 12:04:46,546 INFO L226 Difference]: Without dead ends: 2333 [2019-12-07 12:04:46,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2019-12-07 12:04:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2333. [2019-12-07 12:04:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-12-07 12:04:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 6431 transitions. [2019-12-07 12:04:46,570 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 6431 transitions. Word has length 48 [2019-12-07 12:04:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:46,570 INFO L462 AbstractCegarLoop]: Abstraction has 2333 states and 6431 transitions. [2019-12-07 12:04:46,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 6431 transitions. [2019-12-07 12:04:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:04:46,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:46,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:46,573 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1345283023, now seen corresponding path program 3 times [2019-12-07 12:04:46,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:46,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615908530] [2019-12-07 12:04:46,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:46,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615908530] [2019-12-07 12:04:46,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:46,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:46,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003354190] [2019-12-07 12:04:46,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:46,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:46,607 INFO L87 Difference]: Start difference. First operand 2333 states and 6431 transitions. Second operand 4 states. [2019-12-07 12:04:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:46,622 INFO L93 Difference]: Finished difference Result 2771 states and 7376 transitions. [2019-12-07 12:04:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:46,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 12:04:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:46,623 INFO L225 Difference]: With dead ends: 2771 [2019-12-07 12:04:46,623 INFO L226 Difference]: Without dead ends: 486 [2019-12-07 12:04:46,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-07 12:04:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-07 12:04:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-07 12:04:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1030 transitions. [2019-12-07 12:04:46,627 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1030 transitions. Word has length 48 [2019-12-07 12:04:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:46,627 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1030 transitions. [2019-12-07 12:04:46,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1030 transitions. [2019-12-07 12:04:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:04:46,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:46,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:46,628 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash -954630289, now seen corresponding path program 4 times [2019-12-07 12:04:46,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:46,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118697301] [2019-12-07 12:04:46,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:46,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118697301] [2019-12-07 12:04:46,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:46,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:04:46,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686720013] [2019-12-07 12:04:46,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:04:46,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:04:46,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:46,674 INFO L87 Difference]: Start difference. First operand 486 states and 1030 transitions. Second operand 7 states. [2019-12-07 12:04:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:46,779 INFO L93 Difference]: Finished difference Result 862 states and 1799 transitions. [2019-12-07 12:04:46,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:04:46,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 12:04:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:46,780 INFO L225 Difference]: With dead ends: 862 [2019-12-07 12:04:46,780 INFO L226 Difference]: Without dead ends: 576 [2019-12-07 12:04:46,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:04:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-07 12:04:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 518. [2019-12-07 12:04:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-12-07 12:04:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1090 transitions. [2019-12-07 12:04:46,787 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1090 transitions. Word has length 48 [2019-12-07 12:04:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:46,787 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 1090 transitions. [2019-12-07 12:04:46,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:04:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1090 transitions. [2019-12-07 12:04:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 12:04:46,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:46,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:46,788 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash 477153033, now seen corresponding path program 5 times [2019-12-07 12:04:46,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:46,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841831339] [2019-12-07 12:04:46,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:04:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:04:46,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:04:46,857 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:04:46,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t965~0.base_44|)) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t965~0.base_44| 4)) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t965~0.base_44|) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= |v_ULTIMATE.start_main_~#t965~0.offset_29| 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t965~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t965~0.base_44|) |v_ULTIMATE.start_main_~#t965~0.offset_29| 0)) |v_#memory_int_29|) (= v_~z~0_135 0) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t965~0.base_44| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t965~0.base=|v_ULTIMATE.start_main_~#t965~0.base_44|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_39|, ~x~0=v_~x~0_37, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_20|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_39|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ULTIMATE.start_main_~#t965~0.offset=|v_ULTIMATE.start_main_~#t965~0.offset_29|, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t968~0.base, #NULL.offset, ULTIMATE.start_main_~#t965~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t966~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t967~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t966~0.base, ~x~0, ULTIMATE.start_main_~#t968~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t967~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t965~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:04:46,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t966~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12|) |v_ULTIMATE.start_main_~#t966~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t966~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t966~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t966~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_10|, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t966~0.offset, ULTIMATE.start_main_~#t966~0.base] because there is no mapped edge [2019-12-07 12:04:46,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13|) |v_ULTIMATE.start_main_~#t967~0.offset_11| 2)) |v_#memory_int_21|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t967~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t967~0.base_13|) (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13| 1) |v_#valid_54|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t967~0.base_13| 4) |v_#length_23|) (not (= 0 |v_ULTIMATE.start_main_~#t967~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t967~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t967~0.offset, #length] because there is no mapped edge [2019-12-07 12:04:46,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10|) |v_ULTIMATE.start_main_~#t968~0.offset_9| 3)) |v_#memory_int_15|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t968~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t968~0.base_10|) (= |v_ULTIMATE.start_main_~#t968~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t968~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t968~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t968~0.base, #length] because there is no mapped edge [2019-12-07 12:04:46,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14 0)) (= 1 v_~a~0_5) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 12:04:46,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 12:04:46,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 12:04:46,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In179325246 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite9_Out179325246|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In179325246 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In179325246 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In179325246 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In179325246 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite9_Out179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) .cse0 (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite8_Out179325246|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In179325246|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out179325246|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out179325246|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:04:46,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 12:04:46,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 12:04:46,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1590328055 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| ~z$w_buff0_used~0_In-1590328055)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1590328055|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:04:46,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1978141499 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1978141499 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1978141499 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1978141499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| ~z$w_buff1_used~0_In1978141499) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1978141499|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:04:46,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In2096769610 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out2096769610 ~z$r_buff0_thd4~0_In2096769610)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out2096769610) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2096769610} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2096769610, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out2096769610|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 12:04:46,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:04:46,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:04:46,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_50) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:04:46,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In89039659 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In89039659 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In89039659 |ULTIMATE.start_main_#t~ite36_Out89039659|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out89039659| ~z~0_In89039659)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out89039659|, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 12:04:46,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 12:04:46,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1291914956 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1291914956 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| ~z$w_buff0_used~0_In-1291914956) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1291914956|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:04:46,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In908169825 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In908169825 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out908169825| ~z$w_buff1_used~0_In908169825)) (and (= |ULTIMATE.start_main_#t~ite39_Out908169825| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out908169825|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:04:46,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1210292619 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1210292619| ~z$r_buff0_thd0~0_In1210292619)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1210292619|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:04:46,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1214179106 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1214179106 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1214179106 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1214179106 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1214179106 |ULTIMATE.start_main_#t~ite41_Out-1214179106|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1214179106|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1214179106|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 12:04:46,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:04:46,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:04:46 BasicIcfg [2019-12-07 12:04:46,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:04:46,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:04:46,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:04:46,928 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:04:46,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:04:30" (3/4) ... [2019-12-07 12:04:46,930 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:04:46,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t965~0.base_44|)) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t965~0.base_44| 4)) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t965~0.base_44|) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= |v_ULTIMATE.start_main_~#t965~0.offset_29| 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t965~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t965~0.base_44|) |v_ULTIMATE.start_main_~#t965~0.offset_29| 0)) |v_#memory_int_29|) (= v_~z~0_135 0) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t965~0.base_44| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t965~0.base=|v_ULTIMATE.start_main_~#t965~0.base_44|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_39|, ~x~0=v_~x~0_37, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_20|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_39|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ULTIMATE.start_main_~#t965~0.offset=|v_ULTIMATE.start_main_~#t965~0.offset_29|, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t968~0.base, #NULL.offset, ULTIMATE.start_main_~#t965~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t966~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t967~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t966~0.base, ~x~0, ULTIMATE.start_main_~#t968~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t967~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t965~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:04:46,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t966~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12|) |v_ULTIMATE.start_main_~#t966~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t966~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t966~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t966~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_10|, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t966~0.offset, ULTIMATE.start_main_~#t966~0.base] because there is no mapped edge [2019-12-07 12:04:46,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13|) |v_ULTIMATE.start_main_~#t967~0.offset_11| 2)) |v_#memory_int_21|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t967~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t967~0.base_13|) (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13| 1) |v_#valid_54|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t967~0.base_13| 4) |v_#length_23|) (not (= 0 |v_ULTIMATE.start_main_~#t967~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t967~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t967~0.offset, #length] because there is no mapped edge [2019-12-07 12:04:46,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10|) |v_ULTIMATE.start_main_~#t968~0.offset_9| 3)) |v_#memory_int_15|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t968~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t968~0.base_10|) (= |v_ULTIMATE.start_main_~#t968~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t968~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t968~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t968~0.base, #length] because there is no mapped edge [2019-12-07 12:04:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14 0)) (= 1 v_~a~0_5) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 12:04:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 12:04:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 12:04:46,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In179325246 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite9_Out179325246|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In179325246 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In179325246 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In179325246 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In179325246 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite9_Out179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) .cse0 (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite8_Out179325246|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In179325246|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out179325246|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out179325246|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:04:46,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 12:04:46,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 12:04:46,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1590328055 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| ~z$w_buff0_used~0_In-1590328055)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1590328055|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1978141499 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1978141499 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1978141499 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1978141499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| ~z$w_buff1_used~0_In1978141499) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1978141499|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In2096769610 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out2096769610 ~z$r_buff0_thd4~0_In2096769610)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out2096769610) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2096769610} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2096769610, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out2096769610|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 12:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_50) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:04:46,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In89039659 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In89039659 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In89039659 |ULTIMATE.start_main_#t~ite36_Out89039659|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out89039659| ~z~0_In89039659)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out89039659|, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 12:04:46,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 12:04:46,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1291914956 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1291914956 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| ~z$w_buff0_used~0_In-1291914956) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1291914956|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:04:46,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In908169825 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In908169825 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out908169825| ~z$w_buff1_used~0_In908169825)) (and (= |ULTIMATE.start_main_#t~ite39_Out908169825| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out908169825|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:04:46,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1210292619 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1210292619| ~z$r_buff0_thd0~0_In1210292619)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1210292619|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:04:46,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1214179106 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1214179106 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1214179106 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1214179106 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1214179106 |ULTIMATE.start_main_#t~ite41_Out-1214179106|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1214179106|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1214179106|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 12:04:46,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:04:46,994 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8ea5a333-22a3-43ba-9e3f-e38bc3507e44/bin/uautomizer/witness.graphml [2019-12-07 12:04:46,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:04:46,995 INFO L168 Benchmark]: Toolchain (without parser) took 17357.13 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -275.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 12:04:46,995 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:04:46,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:46,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.13 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 12:04:46,996 INFO L168 Benchmark]: Boogie Preprocessor took 26.09 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 12:04:46,996 INFO L168 Benchmark]: RCFGBuilder took 393.64 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:46,997 INFO L168 Benchmark]: TraceAbstraction took 16440.16 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -237.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 12:04:46,997 INFO L168 Benchmark]: Witness Printer took 66.37 ms. Allocated memory is still 2.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:46,998 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.13 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 26.09 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. * RCFGBuilder took 393.64 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16440.16 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -237.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 66.37 ms. Allocated memory is still 2.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 171 ProgramPointsBefore, 79 ProgramPointsAfterwards, 193 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 19 ChoiceCompositions, 5629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 182 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 48496 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t965, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t966, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t967, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t968, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2656 SDtfs, 2581 SDslu, 4068 SDs, 0 SdLazy, 1114 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39262occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 29149 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 97378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...