./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ef37f6e42a6b5b21facb2aecbfff2cdd2e29a7ec .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-28 18:14:56,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:56,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:56,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:56,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:56,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:56,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:56,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:56,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:56,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:56,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:56,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:56,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:56,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:56,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:56,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:56,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:56,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:56,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:56,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:56,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:56,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:56,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:56,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:56,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:56,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:56,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:56,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:56,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:56,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:56,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:56,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:56,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:56,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:56,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:56,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:56,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:56,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:56,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:56,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:56,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:56,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:14:56,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:56,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:56,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:56,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:56,983 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:56,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:56,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:56,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:56,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:56,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:56,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:56,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:56,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:56,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:56,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:56,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:56,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:56,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:56,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:56,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:56,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:56,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:56,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:56,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:56,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:56,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:56,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:56,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:56,991 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:56,991 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ef37f6e42a6b5b21facb2aecbfff2cdd2e29a7ec [2019-11-28 18:14:57,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:57,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:57,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:57,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:57,354 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:57,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i [2019-11-28 18:14:57,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155ac777a/ea4fb8d438d14d8494b2ae995a1f7c18/FLAGca1d760d0 [2019-11-28 18:14:57,969 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:57,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_rmo.opt.i [2019-11-28 18:14:57,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155ac777a/ea4fb8d438d14d8494b2ae995a1f7c18/FLAGca1d760d0 [2019-11-28 18:14:58,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155ac777a/ea4fb8d438d14d8494b2ae995a1f7c18 [2019-11-28 18:14:58,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:58,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:58,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:58,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:58,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:58,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:58" (1/1) ... [2019-11-28 18:14:58,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5d8596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:58, skipping insertion in model container [2019-11-28 18:14:58,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:58" (1/1) ... [2019-11-28 18:14:58,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:58,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:58,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:58,999 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:59,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:59,221 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:59,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59 WrapperNode [2019-11-28 18:14:59,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:59,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:59,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:59,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:59,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:59,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:59,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:59,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:59,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... [2019-11-28 18:14:59,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:59,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:59,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:59,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:59,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:14:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:59,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:59,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:59,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:59,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:59,451 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:15:00,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:15:00,148 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:15:00,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:15:00 BoogieIcfgContainer [2019-11-28 18:15:00,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:15:00,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:15:00,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:15:00,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:15:00,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:58" (1/3) ... [2019-11-28 18:15:00,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16302f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:15:00, skipping insertion in model container [2019-11-28 18:15:00,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:59" (2/3) ... [2019-11-28 18:15:00,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16302f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:15:00, skipping insertion in model container [2019-11-28 18:15:00,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:15:00" (3/3) ... [2019-11-28 18:15:00,163 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt.i [2019-11-28 18:15:00,174 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:15:00,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:15:00,188 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:15:00,190 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:15:00,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,263 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:15:00,297 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:15:00,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:15:00,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:15:00,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:15:00,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:15:00,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:15:00,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:15:00,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:15:00,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:15:00,348 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:15:00,350 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:15:00,435 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:15:00,435 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:15:00,451 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 463 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:15:00,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:15:00,519 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:15:00,519 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:15:00,526 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 463 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:15:00,542 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-11-28 18:15:00,543 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:15:04,914 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:15:05,044 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:15:05,086 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-11-28 18:15:05,086 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-11-28 18:15:05,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-11-28 18:15:05,617 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-11-28 18:15:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-11-28 18:15:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:15:05,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:05,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:15:05,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-11-28 18:15:05,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:05,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836239308] [2019-11-28 18:15:05,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:05,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836239308] [2019-11-28 18:15:05,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:05,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:15:05,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227938389] [2019-11-28 18:15:05,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:05,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:05,947 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-11-28 18:15:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:06,230 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-11-28 18:15:06,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:06,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:15:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:06,325 INFO L225 Difference]: With dead ends: 8170 [2019-11-28 18:15:06,325 INFO L226 Difference]: Without dead ends: 8001 [2019-11-28 18:15:06,326 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-11-28 18:15:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-11-28 18:15:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-11-28 18:15:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-11-28 18:15:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-11-28 18:15:06,753 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-11-28 18:15:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:06,754 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-11-28 18:15:06,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-11-28 18:15:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:15:06,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:06,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:06,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:06,758 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-11-28 18:15:06,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:06,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868369765] [2019-11-28 18:15:06,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:06,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868369765] [2019-11-28 18:15:06,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:06,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:06,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796571688] [2019-11-28 18:15:06,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:06,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:06,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:06,879 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-11-28 18:15:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:07,452 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-11-28 18:15:07,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:07,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:15:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:07,545 INFO L225 Difference]: With dead ends: 12769 [2019-11-28 18:15:07,545 INFO L226 Difference]: Without dead ends: 12762 [2019-11-28 18:15:07,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-11-28 18:15:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-11-28 18:15:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-11-28 18:15:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-11-28 18:15:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-11-28 18:15:08,267 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-11-28 18:15:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:08,268 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-11-28 18:15:08,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-11-28 18:15:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:15:08,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:08,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:08,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-11-28 18:15:08,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:08,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337209616] [2019-11-28 18:15:08,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:08,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337209616] [2019-11-28 18:15:08,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:08,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185392207] [2019-11-28 18:15:08,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:08,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:08,416 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-11-28 18:15:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:08,772 INFO L93 Difference]: Finished difference Result 14137 states and 44209 transitions. [2019-11-28 18:15:08,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:08,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:15:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:08,822 INFO L225 Difference]: With dead ends: 14137 [2019-11-28 18:15:08,823 INFO L226 Difference]: Without dead ends: 14137 [2019-11-28 18:15:08,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14137 states. [2019-11-28 18:15:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14137 to 12459. [2019-11-28 18:15:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-11-28 18:15:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 39325 transitions. [2019-11-28 18:15:09,241 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 39325 transitions. Word has length 11 [2019-11-28 18:15:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:09,241 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 39325 transitions. [2019-11-28 18:15:09,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 39325 transitions. [2019-11-28 18:15:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:15:09,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:09,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:09,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 289140598, now seen corresponding path program 1 times [2019-11-28 18:15:09,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:09,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486999241] [2019-11-28 18:15:09,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:09,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486999241] [2019-11-28 18:15:09,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:09,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:09,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809171878] [2019-11-28 18:15:09,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:09,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:09,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:09,333 INFO L87 Difference]: Start difference. First operand 12459 states and 39325 transitions. Second operand 5 states. [2019-11-28 18:15:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:09,808 INFO L93 Difference]: Finished difference Result 16999 states and 52476 transitions. [2019-11-28 18:15:09,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:15:09,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 18:15:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:09,875 INFO L225 Difference]: With dead ends: 16999 [2019-11-28 18:15:09,875 INFO L226 Difference]: Without dead ends: 16992 [2019-11-28 18:15:09,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:15:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2019-11-28 18:15:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 12516. [2019-11-28 18:15:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12516 states. [2019-11-28 18:15:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12516 states to 12516 states and 39375 transitions. [2019-11-28 18:15:10,303 INFO L78 Accepts]: Start accepts. Automaton has 12516 states and 39375 transitions. Word has length 17 [2019-11-28 18:15:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,303 INFO L462 AbstractCegarLoop]: Abstraction has 12516 states and 39375 transitions. [2019-11-28 18:15:10,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 12516 states and 39375 transitions. [2019-11-28 18:15:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:15:10,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:10,547 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1619137928, now seen corresponding path program 1 times [2019-11-28 18:15:10,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111764014] [2019-11-28 18:15:10,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:10,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111764014] [2019-11-28 18:15:10,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:10,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422772064] [2019-11-28 18:15:10,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:10,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:10,617 INFO L87 Difference]: Start difference. First operand 12516 states and 39375 transitions. Second operand 4 states. [2019-11-28 18:15:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:10,656 INFO L93 Difference]: Finished difference Result 2110 states and 4812 transitions. [2019-11-28 18:15:10,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:15:10,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 18:15:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:10,661 INFO L225 Difference]: With dead ends: 2110 [2019-11-28 18:15:10,661 INFO L226 Difference]: Without dead ends: 1824 [2019-11-28 18:15:10,662 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-11-28 18:15:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-11-28 18:15:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-11-28 18:15:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-11-28 18:15:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4021 transitions. [2019-11-28 18:15:10,689 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4021 transitions. Word has length 25 [2019-11-28 18:15:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,690 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4021 transitions. [2019-11-28 18:15:10,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4021 transitions. [2019-11-28 18:15:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 18:15:10,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,695 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] [2019-11-28 18:15:10,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash 736634855, now seen corresponding path program 1 times [2019-11-28 18:15:10,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349415970] [2019-11-28 18:15:10,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:10,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349415970] [2019-11-28 18:15:10,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:15:10,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234583516] [2019-11-28 18:15:10,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:10,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:10,826 INFO L87 Difference]: Start difference. First operand 1824 states and 4021 transitions. Second operand 5 states. [2019-11-28 18:15:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:10,875 INFO L93 Difference]: Finished difference Result 419 states and 767 transitions. [2019-11-28 18:15:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:10,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 18:15:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:10,877 INFO L225 Difference]: With dead ends: 419 [2019-11-28 18:15:10,877 INFO L226 Difference]: Without dead ends: 373 [2019-11-28 18:15:10,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-28 18:15:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 338. [2019-11-28 18:15:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-11-28 18:15:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 612 transitions. [2019-11-28 18:15:10,884 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 612 transitions. Word has length 37 [2019-11-28 18:15:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,884 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 612 transitions. [2019-11-28 18:15:10,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 612 transitions. [2019-11-28 18:15:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:10,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:10,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1915125863, now seen corresponding path program 1 times [2019-11-28 18:15:10,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371307437] [2019-11-28 18:15:10,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:10,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371307437] [2019-11-28 18:15:10,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:10,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219000831] [2019-11-28 18:15:10,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:10,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:10,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:10,971 INFO L87 Difference]: Start difference. First operand 338 states and 612 transitions. Second operand 3 states. [2019-11-28 18:15:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:11,019 INFO L93 Difference]: Finished difference Result 352 states and 630 transitions. [2019-11-28 18:15:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:11,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:15:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:11,021 INFO L225 Difference]: With dead ends: 352 [2019-11-28 18:15:11,021 INFO L226 Difference]: Without dead ends: 352 [2019-11-28 18:15:11,021 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-11-28 18:15:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-28 18:15:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-11-28 18:15:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-28 18:15:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-11-28 18:15:11,027 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 52 [2019-11-28 18:15:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:11,028 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-11-28 18:15:11,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-11-28 18:15:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:11,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:11,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:11,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1804822393, now seen corresponding path program 1 times [2019-11-28 18:15:11,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:11,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433648506] [2019-11-28 18:15:11,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:11,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433648506] [2019-11-28 18:15:11,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:11,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:11,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430109476] [2019-11-28 18:15:11,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:11,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:11,126 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-11-28 18:15:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:11,140 INFO L93 Difference]: Finished difference Result 348 states and 613 transitions. [2019-11-28 18:15:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:11,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:15:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:11,141 INFO L225 Difference]: With dead ends: 348 [2019-11-28 18:15:11,141 INFO L226 Difference]: Without dead ends: 348 [2019-11-28 18:15:11,142 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-11-28 18:15:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-28 18:15:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-11-28 18:15:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-28 18:15:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 613 transitions. [2019-11-28 18:15:11,148 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 613 transitions. Word has length 52 [2019-11-28 18:15:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:11,148 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 613 transitions. [2019-11-28 18:15:11,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 613 transitions. [2019-11-28 18:15:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:15:11,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:11,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:11,150 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1986059885, now seen corresponding path program 1 times [2019-11-28 18:15:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:11,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94865537] [2019-11-28 18:15:11,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:11,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94865537] [2019-11-28 18:15:11,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:11,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:11,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368956332] [2019-11-28 18:15:11,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:11,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:11,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:11,259 INFO L87 Difference]: Start difference. First operand 348 states and 613 transitions. Second operand 3 states. [2019-11-28 18:15:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:11,299 INFO L93 Difference]: Finished difference Result 347 states and 611 transitions. [2019-11-28 18:15:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:11,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:15:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:11,300 INFO L225 Difference]: With dead ends: 347 [2019-11-28 18:15:11,301 INFO L226 Difference]: Without dead ends: 347 [2019-11-28 18:15:11,301 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-11-28 18:15:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-28 18:15:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-11-28 18:15:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-28 18:15:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 611 transitions. [2019-11-28 18:15:11,307 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 611 transitions. Word has length 53 [2019-11-28 18:15:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:11,308 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 611 transitions. [2019-11-28 18:15:11,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 611 transitions. [2019-11-28 18:15:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:15:11,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:11,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:11,310 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-11-28 18:15:11,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:11,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436849922] [2019-11-28 18:15:11,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:11,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436849922] [2019-11-28 18:15:11,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:11,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:15:11,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817144764] [2019-11-28 18:15:11,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:15:11,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:15:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:11,495 INFO L87 Difference]: Start difference. First operand 347 states and 611 transitions. Second operand 7 states. [2019-11-28 18:15:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:11,609 INFO L93 Difference]: Finished difference Result 560 states and 992 transitions. [2019-11-28 18:15:11,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:15:11,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-28 18:15:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:11,611 INFO L225 Difference]: With dead ends: 560 [2019-11-28 18:15:11,611 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 18:15:11,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:15:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 18:15:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 208. [2019-11-28 18:15:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-28 18:15:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 367 transitions. [2019-11-28 18:15:11,617 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 367 transitions. Word has length 54 [2019-11-28 18:15:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:11,617 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 367 transitions. [2019-11-28 18:15:11,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:15:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 367 transitions. [2019-11-28 18:15:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:15:11,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:11,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:11,619 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-11-28 18:15:11,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:11,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105761300] [2019-11-28 18:15:11,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:11,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:15:11,798 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:15:11,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1099~0.base_20| 4)) (= 0 v_~x$r_buff1_thd2~0_157) (= (select .cse0 |v_ULTIMATE.start_main_~#t1099~0.base_20|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1099~0.base_20|) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1099~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1099~0.base_20|) |v_ULTIMATE.start_main_~#t1099~0.offset_15| 0)) |v_#memory_int_17|) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 v_~__unbuffered_cnt~0_64) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1099~0.base_20| 1)) (= 0 v_~x$w_buff0_used~0_638) (= 0 |v_ULTIMATE.start_main_~#t1099~0.offset_15|) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_~#t1100~0.base=|v_ULTIMATE.start_main_~#t1100~0.base_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ULTIMATE.start_main_~#t1099~0.base=|v_ULTIMATE.start_main_~#t1099~0.base_20|, ULTIMATE.start_main_~#t1099~0.offset=|v_ULTIMATE.start_main_~#t1099~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1100~0.offset=|v_ULTIMATE.start_main_~#t1100~0.offset_14|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1100~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1099~0.base, ULTIMATE.start_main_~#t1099~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1100~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:15:11,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1100~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1100~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1100~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1100~0.base_11|) |v_ULTIMATE.start_main_~#t1100~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1100~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1100~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1100~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1100~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1100~0.offset=|v_ULTIMATE.start_main_~#t1100~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1100~0.base=|v_ULTIMATE.start_main_~#t1100~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1100~0.offset, #length, ULTIMATE.start_main_~#t1100~0.base] because there is no mapped edge [2019-11-28 18:15:11,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0_used~0_78) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_78 256))) (not (= (mod v_~x$w_buff1_used~0_47 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:15:11,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out372066200| |P0Thread1of1ForFork0_#t~ite4_Out372066200|)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In372066200 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In372066200 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out372066200| ~x$w_buff1~0_In372066200)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out372066200| ~x~0_In372066200) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In372066200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In372066200, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In372066200, ~x~0=~x~0_In372066200} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out372066200|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out372066200|, ~x$w_buff1~0=~x$w_buff1~0_In372066200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In372066200, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In372066200, ~x~0=~x~0_In372066200} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:15:11,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1267613255 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1267613255 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1267613255| ~x$w_buff0_used~0_In-1267613255) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1267613255| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1267613255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1267613255} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1267613255|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1267613255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1267613255} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:11,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In681265302 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In681265302 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In681265302 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In681265302 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out681265302|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In681265302 |P0Thread1of1ForFork0_#t~ite6_Out681265302|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In681265302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In681265302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In681265302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681265302} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out681265302|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In681265302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In681265302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In681265302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681265302} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:11,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In175078097 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In175078097 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out175078097| 0)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out175078097| ~x$r_buff0_thd1~0_In175078097) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In175078097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175078097} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In175078097, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out175078097|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175078097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:15:11,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In802407856 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In802407856 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In802407856 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In802407856 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In802407856 |P0Thread1of1ForFork0_#t~ite8_Out802407856|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out802407856|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In802407856, ~x$w_buff1_used~0=~x$w_buff1_used~0_In802407856, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In802407856, ~x$w_buff0_used~0=~x$w_buff0_used~0_In802407856} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In802407856, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out802407856|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In802407856, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In802407856, ~x$w_buff0_used~0=~x$w_buff0_used~0_In802407856} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:11,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:15:11,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1100604676 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1100604676 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1100604676| ~x$w_buff0_used~0_In-1100604676)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1100604676|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1100604676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1100604676} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1100604676|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1100604676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1100604676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:15:11,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In882722705 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In882722705 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In882722705 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In882722705 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In882722705 |P1Thread1of1ForFork1_#t~ite12_Out882722705|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out882722705|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In882722705, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In882722705, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In882722705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In882722705} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In882722705, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In882722705, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out882722705|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In882722705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In882722705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:15:11,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1068273669 ~x$r_buff0_thd2~0_Out-1068273669)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1068273669 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1068273669 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1068273669) (not .cse0) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1068273669, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068273669} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1068273669|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1068273669, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068273669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:15:11,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1711909821 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1711909821 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1711909821 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1711909821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1711909821| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1711909821| ~x$r_buff1_thd2~0_In1711909821) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1711909821, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1711909821, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1711909821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1711909821} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1711909821, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1711909821, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1711909821, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1711909821|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1711909821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:15:11,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:15:11,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:15:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1081115157 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1081115157 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1081115157| ~x$w_buff1~0_In1081115157)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1081115157| ~x~0_In1081115157)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1081115157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1081115157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1081115157, ~x~0=~x~0_In1081115157} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1081115157|, ~x$w_buff1~0=~x$w_buff1~0_In1081115157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1081115157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1081115157, ~x~0=~x~0_In1081115157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:15:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:15:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-581057601 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-581057601 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-581057601| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-581057601| ~x$w_buff0_used~0_In-581057601)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581057601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581057601} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581057601, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-581057601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581057601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:15:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-543935807 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-543935807 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-543935807 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-543935807 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-543935807| ~x$w_buff1_used~0_In-543935807)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-543935807|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-543935807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-543935807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-543935807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-543935807} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-543935807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-543935807, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-543935807|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-543935807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-543935807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:15:11,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In690030839 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In690030839 256)))) (or (and (= ~x$r_buff0_thd0~0_In690030839 |ULTIMATE.start_main_#t~ite21_Out690030839|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out690030839|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In690030839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690030839} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In690030839, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out690030839|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690030839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:15:11,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1850501640 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1850501640 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1850501640 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1850501640 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1850501640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out-1850501640| ~x$r_buff1_thd0~0_In-1850501640) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1850501640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850501640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1850501640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850501640} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1850501640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850501640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1850501640, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1850501640|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850501640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:15:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1205479969 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-1205479969| |ULTIMATE.start_main_#t~ite32_Out-1205479969|) (= |ULTIMATE.start_main_#t~ite31_Out-1205479969| ~x$w_buff1~0_In-1205479969) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1205479969 256)))) (or (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-1205479969 256) 0)) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1205479969 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1205479969 256)))) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In-1205479969 |ULTIMATE.start_main_#t~ite32_Out-1205479969|) (= |ULTIMATE.start_main_#t~ite31_In-1205479969| |ULTIMATE.start_main_#t~ite31_Out-1205479969|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1205479969, ~x$w_buff1~0=~x$w_buff1~0_In-1205479969, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1205479969, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1205479969, ~weak$$choice2~0=~weak$$choice2~0_In-1205479969, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1205479969|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1205479969} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1205479969, ~x$w_buff1~0=~x$w_buff1~0_In-1205479969, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1205479969, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1205479969|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1205479969, ~weak$$choice2~0=~weak$$choice2~0_In-1205479969, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1205479969|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1205479969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-11-28 18:15:11,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1653674367 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1653674367| ~x$w_buff1_used~0_In1653674367) (= |ULTIMATE.start_main_#t~ite37_In1653674367| |ULTIMATE.start_main_#t~ite37_Out1653674367|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite38_Out1653674367| |ULTIMATE.start_main_#t~ite37_Out1653674367|) .cse0 (= ~x$w_buff1_used~0_In1653674367 |ULTIMATE.start_main_#t~ite37_Out1653674367|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1653674367 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In1653674367 256) 0)) (and (= (mod ~x$w_buff1_used~0_In1653674367 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1653674367 256))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1653674367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1653674367, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1653674367|, ~weak$$choice2~0=~weak$$choice2~0_In1653674367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1653674367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653674367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1653674367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1653674367, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1653674367|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1653674367|, ~weak$$choice2~0=~weak$$choice2~0_In1653674367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1653674367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653674367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:15:11,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:15:11,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:15:11,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:15:11 BasicIcfg [2019-11-28 18:15:11,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:15:11,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:15:11,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:15:11,913 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:15:11,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:15:00" (3/4) ... [2019-11-28 18:15:11,916 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:15:11,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1099~0.base_20| 4)) (= 0 v_~x$r_buff1_thd2~0_157) (= (select .cse0 |v_ULTIMATE.start_main_~#t1099~0.base_20|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1099~0.base_20|) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1099~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1099~0.base_20|) |v_ULTIMATE.start_main_~#t1099~0.offset_15| 0)) |v_#memory_int_17|) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 v_~__unbuffered_cnt~0_64) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1099~0.base_20| 1)) (= 0 v_~x$w_buff0_used~0_638) (= 0 |v_ULTIMATE.start_main_~#t1099~0.offset_15|) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_~#t1100~0.base=|v_ULTIMATE.start_main_~#t1100~0.base_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ULTIMATE.start_main_~#t1099~0.base=|v_ULTIMATE.start_main_~#t1099~0.base_20|, ULTIMATE.start_main_~#t1099~0.offset=|v_ULTIMATE.start_main_~#t1099~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1100~0.offset=|v_ULTIMATE.start_main_~#t1100~0.offset_14|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1100~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1099~0.base, ULTIMATE.start_main_~#t1099~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1100~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:15:11,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1100~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1100~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1100~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1100~0.base_11|) |v_ULTIMATE.start_main_~#t1100~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1100~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1100~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1100~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1100~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1100~0.offset=|v_ULTIMATE.start_main_~#t1100~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1100~0.base=|v_ULTIMATE.start_main_~#t1100~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1100~0.offset, #length, ULTIMATE.start_main_~#t1100~0.base] because there is no mapped edge [2019-11-28 18:15:11,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0_used~0_78) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_78 256))) (not (= (mod v_~x$w_buff1_used~0_47 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:15:11,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out372066200| |P0Thread1of1ForFork0_#t~ite4_Out372066200|)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In372066200 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In372066200 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out372066200| ~x$w_buff1~0_In372066200)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out372066200| ~x~0_In372066200) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In372066200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In372066200, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In372066200, ~x~0=~x~0_In372066200} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out372066200|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out372066200|, ~x$w_buff1~0=~x$w_buff1~0_In372066200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In372066200, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In372066200, ~x~0=~x~0_In372066200} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:15:11,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1267613255 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1267613255 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1267613255| ~x$w_buff0_used~0_In-1267613255) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1267613255| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1267613255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1267613255} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1267613255|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1267613255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1267613255} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:11,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In681265302 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In681265302 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In681265302 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In681265302 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out681265302|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In681265302 |P0Thread1of1ForFork0_#t~ite6_Out681265302|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In681265302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In681265302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In681265302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681265302} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out681265302|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In681265302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In681265302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In681265302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681265302} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:11,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In175078097 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In175078097 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out175078097| 0)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out175078097| ~x$r_buff0_thd1~0_In175078097) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In175078097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175078097} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In175078097, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out175078097|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175078097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:15:11,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In802407856 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In802407856 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In802407856 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In802407856 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In802407856 |P0Thread1of1ForFork0_#t~ite8_Out802407856|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out802407856|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In802407856, ~x$w_buff1_used~0=~x$w_buff1_used~0_In802407856, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In802407856, ~x$w_buff0_used~0=~x$w_buff0_used~0_In802407856} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In802407856, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out802407856|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In802407856, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In802407856, ~x$w_buff0_used~0=~x$w_buff0_used~0_In802407856} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:11,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:15:11,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1100604676 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1100604676 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1100604676| ~x$w_buff0_used~0_In-1100604676)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1100604676|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1100604676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1100604676} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1100604676|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1100604676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1100604676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:15:11,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In882722705 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In882722705 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In882722705 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In882722705 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In882722705 |P1Thread1of1ForFork1_#t~ite12_Out882722705|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out882722705|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In882722705, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In882722705, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In882722705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In882722705} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In882722705, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In882722705, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out882722705|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In882722705, ~x$w_buff0_used~0=~x$w_buff0_used~0_In882722705} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:15:11,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1068273669 ~x$r_buff0_thd2~0_Out-1068273669)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1068273669 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1068273669 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1068273669) (not .cse0) (not .cse2)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1068273669, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068273669} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1068273669|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1068273669, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068273669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:15:11,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1711909821 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1711909821 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1711909821 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1711909821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1711909821| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1711909821| ~x$r_buff1_thd2~0_In1711909821) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1711909821, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1711909821, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1711909821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1711909821} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1711909821, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1711909821, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1711909821, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1711909821|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1711909821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:15:11,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:15:11,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:15:11,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1081115157 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1081115157 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1081115157| ~x$w_buff1~0_In1081115157)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1081115157| ~x~0_In1081115157)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1081115157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1081115157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1081115157, ~x~0=~x~0_In1081115157} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1081115157|, ~x$w_buff1~0=~x$w_buff1~0_In1081115157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1081115157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1081115157, ~x~0=~x~0_In1081115157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:15:11,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:15:11,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-581057601 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-581057601 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-581057601| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-581057601| ~x$w_buff0_used~0_In-581057601)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581057601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581057601} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581057601, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-581057601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581057601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:15:11,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-543935807 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-543935807 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-543935807 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-543935807 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-543935807| ~x$w_buff1_used~0_In-543935807)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-543935807|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-543935807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-543935807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-543935807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-543935807} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-543935807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-543935807, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-543935807|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-543935807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-543935807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:15:11,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In690030839 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In690030839 256)))) (or (and (= ~x$r_buff0_thd0~0_In690030839 |ULTIMATE.start_main_#t~ite21_Out690030839|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out690030839|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In690030839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690030839} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In690030839, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out690030839|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690030839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:15:11,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1850501640 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1850501640 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1850501640 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1850501640 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1850501640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out-1850501640| ~x$r_buff1_thd0~0_In-1850501640) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1850501640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850501640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1850501640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850501640} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1850501640, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850501640, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1850501640, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1850501640|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850501640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:15:11,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1205479969 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-1205479969| |ULTIMATE.start_main_#t~ite32_Out-1205479969|) (= |ULTIMATE.start_main_#t~ite31_Out-1205479969| ~x$w_buff1~0_In-1205479969) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1205479969 256)))) (or (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-1205479969 256) 0)) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1205479969 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1205479969 256)))) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In-1205479969 |ULTIMATE.start_main_#t~ite32_Out-1205479969|) (= |ULTIMATE.start_main_#t~ite31_In-1205479969| |ULTIMATE.start_main_#t~ite31_Out-1205479969|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1205479969, ~x$w_buff1~0=~x$w_buff1~0_In-1205479969, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1205479969, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1205479969, ~weak$$choice2~0=~weak$$choice2~0_In-1205479969, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1205479969|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1205479969} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1205479969, ~x$w_buff1~0=~x$w_buff1~0_In-1205479969, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1205479969, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1205479969|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1205479969, ~weak$$choice2~0=~weak$$choice2~0_In-1205479969, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1205479969|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1205479969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-11-28 18:15:11,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1653674367 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1653674367| ~x$w_buff1_used~0_In1653674367) (= |ULTIMATE.start_main_#t~ite37_In1653674367| |ULTIMATE.start_main_#t~ite37_Out1653674367|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite38_Out1653674367| |ULTIMATE.start_main_#t~ite37_Out1653674367|) .cse0 (= ~x$w_buff1_used~0_In1653674367 |ULTIMATE.start_main_#t~ite37_Out1653674367|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1653674367 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In1653674367 256) 0)) (and (= (mod ~x$w_buff1_used~0_In1653674367 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1653674367 256))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1653674367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1653674367, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1653674367|, ~weak$$choice2~0=~weak$$choice2~0_In1653674367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1653674367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653674367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1653674367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1653674367, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1653674367|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1653674367|, ~weak$$choice2~0=~weak$$choice2~0_In1653674367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1653674367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653674367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:15:11,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:15:11,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:11,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:15:12,078 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:15:12,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:15:12,084 INFO L168 Benchmark]: Toolchain (without parser) took 13826.26 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 526.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 369.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:12,090 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:12,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 967.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:12,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:12,092 INFO L168 Benchmark]: Boogie Preprocessor took 42.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:12,092 INFO L168 Benchmark]: RCFGBuilder took 774.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:12,092 INFO L168 Benchmark]: TraceAbstraction took 11761.32 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 383.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.0 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:12,093 INFO L168 Benchmark]: Witness Printer took 165.65 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:12,096 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.84 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 967.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 774.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11761.32 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 383.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.0 MB). Peak memory consumption was 303.8 MB. Max. memory is 11.5 GB. * Witness Printer took 165.65 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1048 SDtfs, 944 SDslu, 1448 SDs, 0 SdLazy, 671 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12516occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7726 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 38127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...