./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031_tso.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/mix031_tso.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 5d2cd970f76a76b84bde79762c11ce7e22c69784 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:11:42,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:42,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:42,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:42,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:42,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:42,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:42,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:42,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:42,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:42,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:42,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:42,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:42,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:42,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:42,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:42,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:42,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:42,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:42,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:42,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:42,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:42,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:42,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:42,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:42,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:42,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:42,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:42,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:42,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:42,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:42,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:42,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:42,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:42,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:42,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:42,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:42,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:42,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:42,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:42,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:42,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:11:42,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:42,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:42,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:42,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:42,972 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:42,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:42,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:42,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:42,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:42,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:42,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:42,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:42,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:42,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:42,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:42,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:42,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:42,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:42,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:42,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:42,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:42,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:42,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:42,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:42,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:42,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:42,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:42,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:42,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:42,979 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 -> 5d2cd970f76a76b84bde79762c11ce7e22c69784 [2019-11-28 18:11:43,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:43,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:43,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:43,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:43,334 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:43,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-11-28 18:11:43,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83375319/f5f72d05361b4d0781c5e449302e2e10/FLAGcfcb6cd37 [2019-11-28 18:11:43,988 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:43,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-11-28 18:11:44,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83375319/f5f72d05361b4d0781c5e449302e2e10/FLAGcfcb6cd37 [2019-11-28 18:11:44,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83375319/f5f72d05361b4d0781c5e449302e2e10 [2019-11-28 18:11:44,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:44,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:44,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:44,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:44,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:44,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:44" (1/1) ... [2019-11-28 18:11:44,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb72fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:44, skipping insertion in model container [2019-11-28 18:11:44,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:44" (1/1) ... [2019-11-28 18:11:44,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:44,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:44,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:44,938 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:44,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:45,074 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:45,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45 WrapperNode [2019-11-28 18:11:45,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:45,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:45,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:45,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:45,087 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:11:45" (1/1) ... [2019-11-28 18:11:45,110 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:11:45" (1/1) ... [2019-11-28 18:11:45,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:45,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:45,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:45,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:45,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (1/1) ... [2019-11-28 18:11:45,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:45,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:45,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:45,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:45,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (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:11:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:45,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:45,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:45,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:45,288 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:11:45,982 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:45,982 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:45,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:45 BoogieIcfgContainer [2019-11-28 18:11:45,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:45,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:45,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:45,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:45,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:44" (1/3) ... [2019-11-28 18:11:45,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249463cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:45, skipping insertion in model container [2019-11-28 18:11:45,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:45" (2/3) ... [2019-11-28 18:11:45,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249463cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:45, skipping insertion in model container [2019-11-28 18:11:45,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:45" (3/3) ... [2019-11-28 18:11:45,997 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i [2019-11-28 18:11:46,008 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:46,009 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:46,024 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:46,025 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:46,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,079 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:46,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:11:46,143 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:46,143 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:46,143 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:46,143 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:46,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:46,144 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:46,144 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:46,144 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:46,161 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-11-28 18:11:46,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:46,241 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:46,241 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:46,255 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:11:46,273 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-11-28 18:11:46,323 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-11-28 18:11:46,324 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:46,332 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:11:46,351 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:11:46,352 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:50,766 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:11:51,054 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-11-28 18:11:51,217 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 18:11:51,373 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 18:11:51,507 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:51,547 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-11-28 18:11:51,548 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-11-28 18:11:51,551 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-11-28 18:11:51,991 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-11-28 18:11:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-11-28 18:11:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:11:52,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:52,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:11:52,003 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:11:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-11-28 18:11:52,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:52,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514353933] [2019-11-28 18:11:52,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:52,312 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:11:52,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514353933] [2019-11-28 18:11:52,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:52,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:52,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048876853] [2019-11-28 18:11:52,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:52,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:52,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:52,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:52,335 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-11-28 18:11:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:52,550 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-11-28 18:11:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:52,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:11:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:52,628 INFO L225 Difference]: With dead ends: 6414 [2019-11-28 18:11:52,628 INFO L226 Difference]: Without dead ends: 6042 [2019-11-28 18:11:52,630 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:11:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-11-28 18:11:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-11-28 18:11:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-11-28 18:11:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-11-28 18:11:53,063 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-11-28 18:11:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:53,063 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-11-28 18:11:53,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-11-28 18:11:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:11:53,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:53,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:53,070 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:11:53,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-11-28 18:11:53,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:53,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088462344] [2019-11-28 18:11:53,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:53,202 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:11:53,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088462344] [2019-11-28 18:11:53,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:53,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:53,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808216899] [2019-11-28 18:11:53,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:53,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:53,206 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-11-28 18:11:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:53,546 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-11-28 18:11:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:53,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:11:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:53,623 INFO L225 Difference]: With dead ends: 9128 [2019-11-28 18:11:53,624 INFO L226 Difference]: Without dead ends: 9113 [2019-11-28 18:11:53,625 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:11:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-11-28 18:11:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-11-28 18:11:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-11-28 18:11:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-11-28 18:11:54,070 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-11-28 18:11:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:54,071 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-11-28 18:11:54,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-11-28 18:11:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:54,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:54,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:54,077 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:11:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-11-28 18:11:54,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:54,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754641328] [2019-11-28 18:11:54,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:54,152 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:11:54,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754641328] [2019-11-28 18:11:54,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:54,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:54,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484780019] [2019-11-28 18:11:54,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:54,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:54,155 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-11-28 18:11:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:54,439 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-11-28 18:11:54,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:54,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:11:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:54,494 INFO L225 Difference]: With dead ends: 11252 [2019-11-28 18:11:54,495 INFO L226 Difference]: Without dead ends: 11252 [2019-11-28 18:11:54,496 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:11:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-11-28 18:11:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-11-28 18:11:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-11-28 18:11:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-11-28 18:11:54,933 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-11-28 18:11:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:54,934 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-11-28 18:11:54,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-11-28 18:11:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:54,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:54,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:54,938 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:11:54,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-11-28 18:11:54,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:54,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944878791] [2019-11-28 18:11:54,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:54,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944878791] [2019-11-28 18:11:54,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:54,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:54,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888055970] [2019-11-28 18:11:54,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:54,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:54,991 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-11-28 18:11:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:55,266 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-11-28 18:11:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:55,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:55,320 INFO L225 Difference]: With dead ends: 11915 [2019-11-28 18:11:55,321 INFO L226 Difference]: Without dead ends: 11904 [2019-11-28 18:11:55,321 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:11:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-11-28 18:11:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-11-28 18:11:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-11-28 18:11:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-11-28 18:11:55,697 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-11-28 18:11:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:55,698 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-11-28 18:11:55,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-11-28 18:11:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:55,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:55,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:55,702 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:11:55,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-11-28 18:11:55,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:55,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162218917] [2019-11-28 18:11:55,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:55,750 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:11:55,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162218917] [2019-11-28 18:11:55,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:55,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:55,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522388064] [2019-11-28 18:11:55,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:55,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:55,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:55,753 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-11-28 18:11:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:55,967 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-11-28 18:11:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:55,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:56,016 INFO L225 Difference]: With dead ends: 12870 [2019-11-28 18:11:56,017 INFO L226 Difference]: Without dead ends: 12857 [2019-11-28 18:11:56,017 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:11:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-11-28 18:11:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-11-28 18:11:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-11-28 18:11:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-11-28 18:11:56,524 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-11-28 18:11:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:56,525 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-11-28 18:11:56,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-11-28 18:11:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:56,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:56,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:56,533 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:11:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-11-28 18:11:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:56,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793704416] [2019-11-28 18:11:56,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:56,693 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:11:56,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793704416] [2019-11-28 18:11:56,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:56,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:56,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908503716] [2019-11-28 18:11:56,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:56,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:56,695 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-11-28 18:11:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:56,770 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-11-28 18:11:56,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:56,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:56,810 INFO L225 Difference]: With dead ends: 10914 [2019-11-28 18:11:56,811 INFO L226 Difference]: Without dead ends: 10914 [2019-11-28 18:11:56,811 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:11:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-11-28 18:11:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-11-28 18:11:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-11-28 18:11:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-11-28 18:11:57,143 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-11-28 18:11:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:57,143 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-11-28 18:11:57,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-11-28 18:11:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:11:57,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:57,150 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:11:57,150 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:11:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-11-28 18:11:57,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:57,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910820773] [2019-11-28 18:11:57,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,188 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:11:57,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910820773] [2019-11-28 18:11:57,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:57,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224263384] [2019-11-28 18:11:57,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:57,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:57,191 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 3 states. [2019-11-28 18:11:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:57,211 INFO L93 Difference]: Finished difference Result 1664 states and 4070 transitions. [2019-11-28 18:11:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:57,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:11:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:57,216 INFO L225 Difference]: With dead ends: 1664 [2019-11-28 18:11:57,216 INFO L226 Difference]: Without dead ends: 1664 [2019-11-28 18:11:57,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-28 18:11:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-11-28 18:11:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-28 18:11:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-11-28 18:11:57,254 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 17 [2019-11-28 18:11:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:57,254 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-11-28 18:11:57,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-11-28 18:11:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:57,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:57,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:57,259 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:11:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-11-28 18:11:57,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:57,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329721521] [2019-11-28 18:11:57,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,317 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:11:57,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329721521] [2019-11-28 18:11:57,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:57,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090964911] [2019-11-28 18:11:57,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:57,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:57,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:57,319 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-11-28 18:11:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:57,533 INFO L93 Difference]: Finished difference Result 2291 states and 5479 transitions. [2019-11-28 18:11:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:57,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:57,541 INFO L225 Difference]: With dead ends: 2291 [2019-11-28 18:11:57,542 INFO L226 Difference]: Without dead ends: 2289 [2019-11-28 18:11:57,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-11-28 18:11:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1836. [2019-11-28 18:11:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-11-28 18:11:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4456 transitions. [2019-11-28 18:11:57,589 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4456 transitions. Word has length 26 [2019-11-28 18:11:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:57,590 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 4456 transitions. [2019-11-28 18:11:57,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4456 transitions. [2019-11-28 18:11:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:57,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:57,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:57,594 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:11:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2141135354, now seen corresponding path program 1 times [2019-11-28 18:11:57,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:57,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212188722] [2019-11-28 18:11:57,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,682 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:11:57,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212188722] [2019-11-28 18:11:57,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:57,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599981340] [2019-11-28 18:11:57,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:57,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:57,685 INFO L87 Difference]: Start difference. First operand 1836 states and 4456 transitions. Second operand 3 states. [2019-11-28 18:11:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:57,697 INFO L93 Difference]: Finished difference Result 1835 states and 4454 transitions. [2019-11-28 18:11:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:57,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 18:11:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:57,703 INFO L225 Difference]: With dead ends: 1835 [2019-11-28 18:11:57,703 INFO L226 Difference]: Without dead ends: 1835 [2019-11-28 18:11:57,704 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:11:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-28 18:11:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2019-11-28 18:11:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-11-28 18:11:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4454 transitions. [2019-11-28 18:11:57,743 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4454 transitions. Word has length 26 [2019-11-28 18:11:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:57,745 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 4454 transitions. [2019-11-28 18:11:57,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4454 transitions. [2019-11-28 18:11:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:57,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:57,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:57,749 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:11:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-11-28 18:11:57,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:57,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432361377] [2019-11-28 18:11:57,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,857 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:11:57,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432361377] [2019-11-28 18:11:57,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:57,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043627830] [2019-11-28 18:11:57,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:57,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:57,859 INFO L87 Difference]: Start difference. First operand 1835 states and 4454 transitions. Second operand 5 states. [2019-11-28 18:11:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:58,056 INFO L93 Difference]: Finished difference Result 2295 states and 5484 transitions. [2019-11-28 18:11:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:58,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:11:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:58,061 INFO L225 Difference]: With dead ends: 2295 [2019-11-28 18:11:58,061 INFO L226 Difference]: Without dead ends: 2293 [2019-11-28 18:11:58,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-11-28 18:11:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 1685. [2019-11-28 18:11:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-11-28 18:11:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4123 transitions. [2019-11-28 18:11:58,094 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4123 transitions. Word has length 27 [2019-11-28 18:11:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:58,094 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4123 transitions. [2019-11-28 18:11:58,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4123 transitions. [2019-11-28 18:11:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:58,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:58,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:58,099 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:11:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:58,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1541399368, now seen corresponding path program 1 times [2019-11-28 18:11:58,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:58,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67918508] [2019-11-28 18:11:58,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:58,173 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:11:58,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67918508] [2019-11-28 18:11:58,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:58,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:58,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373005797] [2019-11-28 18:11:58,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:58,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:58,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:58,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:58,175 INFO L87 Difference]: Start difference. First operand 1685 states and 4123 transitions. Second operand 4 states. [2019-11-28 18:11:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:58,193 INFO L93 Difference]: Finished difference Result 723 states and 1652 transitions. [2019-11-28 18:11:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:58,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:11:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:58,195 INFO L225 Difference]: With dead ends: 723 [2019-11-28 18:11:58,195 INFO L226 Difference]: Without dead ends: 723 [2019-11-28 18:11:58,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-28 18:11:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 703. [2019-11-28 18:11:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-11-28 18:11:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1612 transitions. [2019-11-28 18:11:58,206 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1612 transitions. Word has length 27 [2019-11-28 18:11:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:58,206 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1612 transitions. [2019-11-28 18:11:58,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1612 transitions. [2019-11-28 18:11:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:11:58,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:58,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:58,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:58,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:58,210 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-11-28 18:11:58,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:58,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658023243] [2019-11-28 18:11:58,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:58,281 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:11:58,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658023243] [2019-11-28 18:11:58,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:58,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:58,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257394547] [2019-11-28 18:11:58,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:58,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:58,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:58,283 INFO L87 Difference]: Start difference. First operand 703 states and 1612 transitions. Second operand 3 states. [2019-11-28 18:11:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:58,301 INFO L93 Difference]: Finished difference Result 701 states and 1607 transitions. [2019-11-28 18:11:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:58,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:11:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:58,303 INFO L225 Difference]: With dead ends: 701 [2019-11-28 18:11:58,304 INFO L226 Difference]: Without dead ends: 701 [2019-11-28 18:11:58,305 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:11:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-11-28 18:11:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 669. [2019-11-28 18:11:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-28 18:11:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1547 transitions. [2019-11-28 18:11:58,316 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1547 transitions. Word has length 41 [2019-11-28 18:11:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:58,317 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1547 transitions. [2019-11-28 18:11:58,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1547 transitions. [2019-11-28 18:11:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:58,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:58,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:58,320 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:58,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1722201146, now seen corresponding path program 1 times [2019-11-28 18:11:58,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:58,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043742985] [2019-11-28 18:11:58,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:58,472 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:11:58,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043742985] [2019-11-28 18:11:58,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:58,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:58,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998205457] [2019-11-28 18:11:58,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:58,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:58,474 INFO L87 Difference]: Start difference. First operand 669 states and 1547 transitions. Second operand 4 states. [2019-11-28 18:11:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:58,494 INFO L93 Difference]: Finished difference Result 1076 states and 2526 transitions. [2019-11-28 18:11:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:58,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-28 18:11:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:58,496 INFO L225 Difference]: With dead ends: 1076 [2019-11-28 18:11:58,496 INFO L226 Difference]: Without dead ends: 426 [2019-11-28 18:11:58,497 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:11:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-28 18:11:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-28 18:11:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-28 18:11:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1010 transitions. [2019-11-28 18:11:58,508 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1010 transitions. Word has length 42 [2019-11-28 18:11:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:58,508 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 1010 transitions. [2019-11-28 18:11:58,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1010 transitions. [2019-11-28 18:11:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:58,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:58,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:58,510 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -146556572, now seen corresponding path program 2 times [2019-11-28 18:11:58,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:58,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449147813] [2019-11-28 18:11:58,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:58,660 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:11:58,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449147813] [2019-11-28 18:11:58,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:58,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:58,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130383914] [2019-11-28 18:11:58,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:11:58,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:11:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:58,663 INFO L87 Difference]: Start difference. First operand 426 states and 1010 transitions. Second operand 7 states. [2019-11-28 18:11:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:58,861 INFO L93 Difference]: Finished difference Result 818 states and 1885 transitions. [2019-11-28 18:11:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:11:58,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:11:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:58,863 INFO L225 Difference]: With dead ends: 818 [2019-11-28 18:11:58,863 INFO L226 Difference]: Without dead ends: 532 [2019-11-28 18:11:58,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:11:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-28 18:11:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 474. [2019-11-28 18:11:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-28 18:11:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1092 transitions. [2019-11-28 18:11:58,876 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1092 transitions. Word has length 42 [2019-11-28 18:11:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:58,876 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1092 transitions. [2019-11-28 18:11:58,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:11:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1092 transitions. [2019-11-28 18:11:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:11:58,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:58,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:58,879 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:11:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 3 times [2019-11-28 18:11:58,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:58,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993005893] [2019-11-28 18:11:58,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:11:59,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:11:59,026 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:11:59,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t847~0.base_37|) (= v_~x~0_15 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37| 1)) (= v_~y$r_buff1_thd0~0_156 0) (= v_~y$w_buff1_used~0_428 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t847~0.base_37| 4)) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t847~0.offset_26|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37|) |v_ULTIMATE.start_main_~#t847~0.offset_26| 0)) |v_#memory_int_15|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_23|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t847~0.base=|v_ULTIMATE.start_main_~#t847~0.base_37|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t847~0.offset=|v_ULTIMATE.start_main_~#t847~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t848~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t848~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t847~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t847~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:11:59,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t848~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t848~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t848~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t848~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12|) |v_ULTIMATE.start_main_~#t848~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_12|, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t848~0.base, ULTIMATE.start_main_~#t848~0.offset] because there is no mapped edge [2019-11-28 18:11:59,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~__unbuffered_p1_EBX~0_Out585919796 ~a~0_In585919796) (= ~y$r_buff1_thd2~0_Out585919796 ~y$r_buff0_thd2~0_In585919796) (= ~y$r_buff0_thd0~0_In585919796 ~y$r_buff1_thd0~0_Out585919796) (= ~z~0_Out585919796 ~__unbuffered_p1_EAX~0_Out585919796) (= 1 ~z~0_Out585919796) (= ~y$r_buff0_thd2~0_Out585919796 1) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In585919796 0)) (= ~y$r_buff0_thd1~0_In585919796 ~y$r_buff1_thd1~0_Out585919796)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In585919796, ~a~0=~a~0_In585919796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In585919796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In585919796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In585919796} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out585919796, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In585919796, ~a~0=~a~0_In585919796, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out585919796, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out585919796, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out585919796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In585919796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out585919796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In585919796, ~z~0=~z~0_Out585919796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out585919796} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:11:59,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1278280744 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1278280744 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1278280744| ~y$w_buff0_used~0_In-1278280744)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1278280744| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1278280744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1278280744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1278280744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1278280744, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1278280744|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:59,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1944111514 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1944111514 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1944111514 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1944111514 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1944111514|)) (and (= ~y$w_buff1_used~0_In-1944111514 |P1Thread1of1ForFork1_#t~ite29_Out-1944111514|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1944111514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1944111514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1944111514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1944111514} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1944111514, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1944111514|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1944111514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1944111514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1944111514} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:59,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:11:59,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-55554866 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite24_Out-55554866| |P0Thread1of1ForFork0_#t~ite23_Out-55554866|) .cse0 (= |P0Thread1of1ForFork0_#t~ite23_Out-55554866| ~y$r_buff1_thd1~0_In-55554866) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-55554866 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-55554866 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In-55554866 256) 0)) (= (mod ~y$w_buff0_used~0_In-55554866 256) 0)))) (and (= |P0Thread1of1ForFork0_#t~ite24_Out-55554866| ~y$r_buff1_thd1~0_In-55554866) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_In-55554866| |P0Thread1of1ForFork0_#t~ite23_Out-55554866|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-55554866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-55554866, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-55554866, ~weak$$choice2~0=~weak$$choice2~0_In-55554866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55554866, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-55554866|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-55554866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-55554866, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-55554866, ~weak$$choice2~0=~weak$$choice2~0_In-55554866, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-55554866|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-55554866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55554866} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:59,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:11:59,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In1561727322 ~y$r_buff0_thd2~0_Out1561727322)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1561727322 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1561727322 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out1561727322) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1561727322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1561727322} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1561727322|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1561727322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1561727322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:59,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In932273766 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In932273766 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In932273766 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In932273766 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out932273766| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite31_Out932273766| ~y$r_buff1_thd2~0_In932273766)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In932273766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932273766, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In932273766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932273766} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In932273766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932273766, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out932273766|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In932273766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932273766} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:59,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:11:59,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:11:59,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-28263249 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-28263249 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-28263249| ~y$w_buff1~0_In-28263249)) (and (or .cse1 .cse0) (= ~y~0_In-28263249 |ULTIMATE.start_main_#t~ite34_Out-28263249|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-28263249, ~y~0=~y~0_In-28263249, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-28263249, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-28263249} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-28263249, ~y~0=~y~0_In-28263249, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-28263249, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-28263249|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-28263249} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:59,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:59,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-321864858 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-321864858 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-321864858| ~y$w_buff0_used~0_In-321864858) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-321864858| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-321864858, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-321864858} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-321864858, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-321864858, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-321864858|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:59,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-454526323 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-454526323 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-454526323 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-454526323 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-454526323| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-454526323 |ULTIMATE.start_main_#t~ite37_Out-454526323|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-454526323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-454526323, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-454526323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-454526323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-454526323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-454526323, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-454526323|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-454526323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-454526323} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:59,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-479354256 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-479354256 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-479354256| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-479354256| ~y$r_buff0_thd0~0_In-479354256) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-479354256, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-479354256} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-479354256, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-479354256, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-479354256|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:59,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1126491649 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1126491649 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1126491649 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1126491649 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-1126491649 |ULTIMATE.start_main_#t~ite39_Out-1126491649|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1126491649|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126491649, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1126491649, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1126491649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126491649} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126491649, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1126491649|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1126491649, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1126491649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126491649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:59,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:11:59,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:59 BasicIcfg [2019-11-28 18:11:59,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:11:59,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:11:59,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:11:59,168 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:11:59,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:45" (3/4) ... [2019-11-28 18:11:59,171 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:11:59,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t847~0.base_37|) (= v_~x~0_15 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37| 1)) (= v_~y$r_buff1_thd0~0_156 0) (= v_~y$w_buff1_used~0_428 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t847~0.base_37| 4)) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t847~0.offset_26|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37|) |v_ULTIMATE.start_main_~#t847~0.offset_26| 0)) |v_#memory_int_15|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_23|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t847~0.base=|v_ULTIMATE.start_main_~#t847~0.base_37|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t847~0.offset=|v_ULTIMATE.start_main_~#t847~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t848~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t848~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t847~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t847~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:11:59,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t848~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t848~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t848~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t848~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12|) |v_ULTIMATE.start_main_~#t848~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_12|, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t848~0.base, ULTIMATE.start_main_~#t848~0.offset] because there is no mapped edge [2019-11-28 18:11:59,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~__unbuffered_p1_EBX~0_Out585919796 ~a~0_In585919796) (= ~y$r_buff1_thd2~0_Out585919796 ~y$r_buff0_thd2~0_In585919796) (= ~y$r_buff0_thd0~0_In585919796 ~y$r_buff1_thd0~0_Out585919796) (= ~z~0_Out585919796 ~__unbuffered_p1_EAX~0_Out585919796) (= 1 ~z~0_Out585919796) (= ~y$r_buff0_thd2~0_Out585919796 1) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In585919796 0)) (= ~y$r_buff0_thd1~0_In585919796 ~y$r_buff1_thd1~0_Out585919796)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In585919796, ~a~0=~a~0_In585919796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In585919796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In585919796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In585919796} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out585919796, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In585919796, ~a~0=~a~0_In585919796, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out585919796, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out585919796, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out585919796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In585919796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out585919796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In585919796, ~z~0=~z~0_Out585919796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out585919796} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:11:59,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1278280744 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1278280744 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1278280744| ~y$w_buff0_used~0_In-1278280744)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1278280744| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1278280744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1278280744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1278280744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1278280744, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1278280744|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:11:59,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1944111514 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1944111514 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1944111514 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1944111514 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1944111514|)) (and (= ~y$w_buff1_used~0_In-1944111514 |P1Thread1of1ForFork1_#t~ite29_Out-1944111514|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1944111514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1944111514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1944111514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1944111514} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1944111514, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1944111514|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1944111514, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1944111514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1944111514} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:11:59,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:11:59,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-55554866 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite24_Out-55554866| |P0Thread1of1ForFork0_#t~ite23_Out-55554866|) .cse0 (= |P0Thread1of1ForFork0_#t~ite23_Out-55554866| ~y$r_buff1_thd1~0_In-55554866) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-55554866 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-55554866 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In-55554866 256) 0)) (= (mod ~y$w_buff0_used~0_In-55554866 256) 0)))) (and (= |P0Thread1of1ForFork0_#t~ite24_Out-55554866| ~y$r_buff1_thd1~0_In-55554866) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_In-55554866| |P0Thread1of1ForFork0_#t~ite23_Out-55554866|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-55554866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-55554866, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-55554866, ~weak$$choice2~0=~weak$$choice2~0_In-55554866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55554866, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-55554866|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-55554866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-55554866, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-55554866, ~weak$$choice2~0=~weak$$choice2~0_In-55554866, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-55554866|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-55554866|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-55554866} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-11-28 18:11:59,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:11:59,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In1561727322 ~y$r_buff0_thd2~0_Out1561727322)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1561727322 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1561727322 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= 0 ~y$r_buff0_thd2~0_Out1561727322) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1561727322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1561727322} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1561727322|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1561727322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1561727322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:11:59,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In932273766 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In932273766 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In932273766 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In932273766 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out932273766| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite31_Out932273766| ~y$r_buff1_thd2~0_In932273766)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In932273766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932273766, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In932273766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932273766} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In932273766, ~y$w_buff0_used~0=~y$w_buff0_used~0_In932273766, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out932273766|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In932273766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In932273766} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:11:59,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:11:59,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:11:59,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-28263249 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-28263249 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-28263249| ~y$w_buff1~0_In-28263249)) (and (or .cse1 .cse0) (= ~y~0_In-28263249 |ULTIMATE.start_main_#t~ite34_Out-28263249|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-28263249, ~y~0=~y~0_In-28263249, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-28263249, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-28263249} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-28263249, ~y~0=~y~0_In-28263249, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-28263249, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-28263249|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-28263249} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:59,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:11:59,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-321864858 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-321864858 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-321864858| ~y$w_buff0_used~0_In-321864858) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-321864858| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-321864858, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-321864858} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-321864858, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-321864858, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-321864858|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:11:59,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-454526323 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-454526323 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-454526323 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-454526323 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-454526323| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-454526323 |ULTIMATE.start_main_#t~ite37_Out-454526323|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-454526323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-454526323, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-454526323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-454526323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-454526323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-454526323, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-454526323|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-454526323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-454526323} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:11:59,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-479354256 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-479354256 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-479354256| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-479354256| ~y$r_buff0_thd0~0_In-479354256) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-479354256, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-479354256} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-479354256, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-479354256, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-479354256|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:11:59,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1126491649 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1126491649 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1126491649 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1126491649 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-1126491649 |ULTIMATE.start_main_#t~ite39_Out-1126491649|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1126491649|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126491649, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1126491649, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1126491649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126491649} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126491649, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1126491649|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1126491649, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1126491649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126491649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:11:59,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:11:59,280 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:11:59,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:11:59,287 INFO L168 Benchmark]: Toolchain (without parser) took 15006.08 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.0 MB). Free memory was 951.0 MB in the beginning and 785.4 MB in the end (delta: 165.6 MB). Peak memory consumption was 629.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:59,288 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:11:59,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:59,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.96 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:11:59,289 INFO L168 Benchmark]: Boogie Preprocessor took 37.22 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:11:59,289 INFO L168 Benchmark]: RCFGBuilder took 792.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:59,290 INFO L168 Benchmark]: TraceAbstraction took 13180.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.6 MB). Free memory was 1.1 GB in the beginning and 797.6 MB in the end (delta: 256.7 MB). Peak memory consumption was 583.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:59,294 INFO L168 Benchmark]: Witness Printer took 113.02 ms. Allocated memory is still 1.5 GB. Free memory was 797.6 MB in the beginning and 785.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:11:59,296 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 798.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.96 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 37.22 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 792.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13180.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.6 MB). Free memory was 1.1 GB in the beginning and 797.6 MB in the end (delta: 256.7 MB). Peak memory consumption was 583.4 MB. Max. memory is 11.5 GB. * Witness Printer took 113.02 ms. Allocated memory is still 1.5 GB. Free memory was 797.6 MB in the beginning and 785.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1448 SDtfs, 1010 SDslu, 2032 SDs, 0 SdLazy, 861 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 6542 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 36482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...