./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.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/mix009_rmo.oepc.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 e4336846228c37865706e98397140a73ec7d90c3 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:54,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:02:54,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:02:54,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:02:54,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:02:54,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:02:54,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:02:54,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:02:54,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:02:54,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:02:54,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:02:54,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:02:54,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:02:54,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:02:54,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:02:54,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:02:54,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:02:54,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:02:54,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:02:54,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:02:54,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:02:54,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:02:54,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:02:54,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:02:54,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:02:54,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:02:54,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:02:54,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:02:54,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:02:54,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:02:54,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:02:54,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:02:54,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:02:54,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:02:54,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:02:54,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:02:54,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:02:54,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:02:54,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:02:54,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:02:54,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:02:54,159 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:02:54,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:02:54,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:02:54,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:02:54,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:02:54,177 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:02:54,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:02:54,178 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:02:54,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:02:54,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:02:54,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:02:54,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:02:54,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:02:54,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:02:54,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:02:54,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:02:54,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:02:54,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:02:54,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:02:54,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:02:54,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:02:54,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:02:54,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:02:54,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:02:54,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:02:54,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:02:54,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:02:54,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:02:54,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:02:54,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:02:54,184 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 -> e4336846228c37865706e98397140a73ec7d90c3 [2019-11-28 18:02:54,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:02:54,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:02:54,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:02:54,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:02:54,504 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:02:54,505 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i [2019-11-28 18:02:54,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670493e61/9572b89ee269474bb84af3c3cfa8ecd1/FLAG5dfd243ab [2019-11-28 18:02:55,154 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:02:55,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i [2019-11-28 18:02:55,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670493e61/9572b89ee269474bb84af3c3cfa8ecd1/FLAG5dfd243ab [2019-11-28 18:02:55,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670493e61/9572b89ee269474bb84af3c3cfa8ecd1 [2019-11-28 18:02:55,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:02:55,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:02:55,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:02:55,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:02:55,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:02:55,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:02:55" (1/1) ... [2019-11-28 18:02:55,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66dc4b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:55, skipping insertion in model container [2019-11-28 18:02:55,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:02:55" (1/1) ... [2019-11-28 18:02:55,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:02:55,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:02:55,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:02:56,007 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:02:56,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:02:56,174 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:02:56,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56 WrapperNode [2019-11-28 18:02:56,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:02:56,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:02:56,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:02:56,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:02:56,185 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:02:56" (1/1) ... [2019-11-28 18:02:56,207 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:02:56" (1/1) ... [2019-11-28 18:02:56,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:02:56,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:02:56,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:02:56,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:02:56,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (1/1) ... [2019-11-28 18:02:56,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:02:56,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:02:56,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:02:56,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:02:56,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (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:02:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:02:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:02:56,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:02:56,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:02:56,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:02:56,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:02:56,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:02:56,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:02:56,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:02:56,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:02:56,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:02:56,362 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:02:57,155 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:02:57,156 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:02:57,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:57 BoogieIcfgContainer [2019-11-28 18:02:57,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:02:57,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:02:57,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:02:57,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:02:57,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:02:55" (1/3) ... [2019-11-28 18:02:57,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1f9faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:02:57, skipping insertion in model container [2019-11-28 18:02:57,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:56" (2/3) ... [2019-11-28 18:02:57,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1f9faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:02:57, skipping insertion in model container [2019-11-28 18:02:57,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:57" (3/3) ... [2019-11-28 18:02:57,171 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc.i [2019-11-28 18:02:57,178 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:02:57,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:02:57,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:02:57,187 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:02:57,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,228 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,228 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,229 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,229 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:57,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:02:57,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:02:57,316 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:02:57,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:02:57,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:02:57,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:02:57,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:02:57,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:02:57,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:02:57,336 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-11-28 18:02:57,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-11-28 18:02:57,440 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-11-28 18:02:57,441 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:02:57,456 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:02:57,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-11-28 18:02:57,527 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-11-28 18:02:57,527 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:02:57,535 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:02:57,553 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:02:57,554 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:03:02,000 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:03:02,150 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:03:02,458 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:03:02,581 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:03:02,605 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-11-28 18:03:02,605 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-11-28 18:03:02,609 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-11-28 18:03:03,094 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:03:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:03:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:03:03,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:03,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:03:03,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-11-28 18:03:03,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:03,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327449534] [2019-11-28 18:03:03,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:03,422 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:03:03,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327449534] [2019-11-28 18:03:03,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:03,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:03:03,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001540562] [2019-11-28 18:03:03,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:03,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:03,453 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:03:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:03,778 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-11-28 18:03:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:03,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:03:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:03,879 INFO L225 Difference]: With dead ends: 8466 [2019-11-28 18:03:03,879 INFO L226 Difference]: Without dead ends: 7974 [2019-11-28 18:03:03,881 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:03:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-11-28 18:03:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-11-28 18:03:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-11-28 18:03:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-11-28 18:03:04,300 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-11-28 18:03:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:04,301 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-11-28 18:03:04,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-11-28 18:03:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:03:04,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:04,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:04,309 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-11-28 18:03:04,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:04,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272994615] [2019-11-28 18:03:04,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:03:04,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272994615] [2019-11-28 18:03:04,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:04,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:04,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136066952] [2019-11-28 18:03:04,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:04,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:04,421 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-11-28 18:03:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:04,465 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-11-28 18:03:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:04,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:03:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:04,474 INFO L225 Difference]: With dead ends: 1283 [2019-11-28 18:03:04,474 INFO L226 Difference]: Without dead ends: 1283 [2019-11-28 18:03:04,475 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:03:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-28 18:03:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-28 18:03:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-28 18:03:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-11-28 18:03:04,532 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-11-28 18:03:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:04,533 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-11-28 18:03:04,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-11-28 18:03:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:03:04,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:04,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:04,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-11-28 18:03:04,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:04,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700214960] [2019-11-28 18:03:04,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:04,718 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:03:04,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700214960] [2019-11-28 18:03:04,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:04,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:04,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461877578] [2019-11-28 18:03:04,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:04,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:04,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:04,721 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-11-28 18:03:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:05,079 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-11-28 18:03:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:03:05,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:03:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:05,092 INFO L225 Difference]: With dead ends: 1902 [2019-11-28 18:03:05,092 INFO L226 Difference]: Without dead ends: 1902 [2019-11-28 18:03:05,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:05,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-11-28 18:03:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-11-28 18:03:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-11-28 18:03:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-11-28 18:03:05,147 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-11-28 18:03:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:05,148 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-11-28 18:03:05,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-11-28 18:03:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:03:05,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:05,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:05,152 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:05,153 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-11-28 18:03:05,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:05,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866856532] [2019-11-28 18:03:05,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:05,397 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:03:05,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866856532] [2019-11-28 18:03:05,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:05,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:03:05,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466042875] [2019-11-28 18:03:05,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:03:05,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:03:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:05,400 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-11-28 18:03:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:05,845 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-11-28 18:03:05,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:03:05,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:03:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:05,861 INFO L225 Difference]: With dead ends: 2385 [2019-11-28 18:03:05,861 INFO L226 Difference]: Without dead ends: 2385 [2019-11-28 18:03:05,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:03:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-11-28 18:03:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-11-28 18:03:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-11-28 18:03:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-11-28 18:03:05,909 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-11-28 18:03:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:05,909 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-11-28 18:03:05,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:03:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-11-28 18:03:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:03:05,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:05,913 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:03:05,913 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1948393738, now seen corresponding path program 1 times [2019-11-28 18:03:05,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:05,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455459085] [2019-11-28 18:03:05,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:06,020 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:03:06,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455459085] [2019-11-28 18:03:06,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:06,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:03:06,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584796715] [2019-11-28 18:03:06,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:06,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:06,023 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 5 states. [2019-11-28 18:03:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:06,543 INFO L93 Difference]: Finished difference Result 2513 states and 5538 transitions. [2019-11-28 18:03:06,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:03:06,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:03:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:06,561 INFO L225 Difference]: With dead ends: 2513 [2019-11-28 18:03:06,562 INFO L226 Difference]: Without dead ends: 2513 [2019-11-28 18:03:06,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-11-28 18:03:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2218. [2019-11-28 18:03:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-11-28 18:03:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 4956 transitions. [2019-11-28 18:03:06,617 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 4956 transitions. Word has length 26 [2019-11-28 18:03:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:06,618 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 4956 transitions. [2019-11-28 18:03:06,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 4956 transitions. [2019-11-28 18:03:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:03:06,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:06,622 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:03:06,623 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash -53278191, now seen corresponding path program 1 times [2019-11-28 18:03:06,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:06,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576365872] [2019-11-28 18:03:06,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:06,722 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:03:06,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576365872] [2019-11-28 18:03:06,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:06,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:06,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935518813] [2019-11-28 18:03:06,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:06,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:06,725 INFO L87 Difference]: Start difference. First operand 2218 states and 4956 transitions. Second operand 4 states. [2019-11-28 18:03:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:06,750 INFO L93 Difference]: Finished difference Result 2217 states and 4954 transitions. [2019-11-28 18:03:06,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:06,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:03:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:06,758 INFO L225 Difference]: With dead ends: 2217 [2019-11-28 18:03:06,758 INFO L226 Difference]: Without dead ends: 2217 [2019-11-28 18:03:06,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2019-11-28 18:03:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2019-11-28 18:03:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-11-28 18:03:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-11-28 18:03:06,805 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-11-28 18:03:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:06,806 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-11-28 18:03:06,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-11-28 18:03:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:03:06,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:06,810 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] [2019-11-28 18:03:06,810 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-11-28 18:03:06,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:06,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948553016] [2019-11-28 18:03:06,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:03:06,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948553016] [2019-11-28 18:03:06,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:06,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:06,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554731511] [2019-11-28 18:03:06,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:06,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:06,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:06,876 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-11-28 18:03:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:06,899 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-11-28 18:03:06,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:06,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:03:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:06,903 INFO L225 Difference]: With dead ends: 1233 [2019-11-28 18:03:06,904 INFO L226 Difference]: Without dead ends: 1233 [2019-11-28 18:03:06,904 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:03:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-11-28 18:03:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-11-28 18:03:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-11-28 18:03:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-11-28 18:03:06,932 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-11-28 18:03:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:06,933 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-11-28 18:03:06,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-11-28 18:03:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:03:06,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:06,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:06,938 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2075557978, now seen corresponding path program 1 times [2019-11-28 18:03:06,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:06,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495457577] [2019-11-28 18:03:06,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:06,987 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:03:06,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495457577] [2019-11-28 18:03:06,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:06,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:06,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423124909] [2019-11-28 18:03:06,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:06,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:06,990 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-11-28 18:03:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:07,043 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-11-28 18:03:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:07,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:03:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:07,048 INFO L225 Difference]: With dead ends: 1748 [2019-11-28 18:03:07,048 INFO L226 Difference]: Without dead ends: 1748 [2019-11-28 18:03:07,049 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:03:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-11-28 18:03:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-11-28 18:03:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-11-28 18:03:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-11-28 18:03:07,080 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-11-28 18:03:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:07,080 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-11-28 18:03:07,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-11-28 18:03:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:03:07,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:07,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:07,085 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash -175297467, now seen corresponding path program 1 times [2019-11-28 18:03:07,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:07,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184194454] [2019-11-28 18:03:07,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:07,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:03:07,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184194454] [2019-11-28 18:03:07,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:07,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:03:07,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081256181] [2019-11-28 18:03:07,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:03:07,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:03:07,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:07,205 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 7 states. [2019-11-28 18:03:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:07,962 INFO L93 Difference]: Finished difference Result 1848 states and 3839 transitions. [2019-11-28 18:03:07,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:03:07,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-28 18:03:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:07,968 INFO L225 Difference]: With dead ends: 1848 [2019-11-28 18:03:07,969 INFO L226 Difference]: Without dead ends: 1848 [2019-11-28 18:03:07,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:03:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-11-28 18:03:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1301. [2019-11-28 18:03:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-11-28 18:03:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2776 transitions. [2019-11-28 18:03:08,004 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2776 transitions. Word has length 51 [2019-11-28 18:03:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:08,004 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 2776 transitions. [2019-11-28 18:03:08,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:03:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2776 transitions. [2019-11-28 18:03:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:03:08,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:08,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:08,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2037363857, now seen corresponding path program 2 times [2019-11-28 18:03:08,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:08,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058124441] [2019-11-28 18:03:08,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:08,161 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:03:08,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058124441] [2019-11-28 18:03:08,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:08,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:03:08,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206350086] [2019-11-28 18:03:08,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:08,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:08,166 INFO L87 Difference]: Start difference. First operand 1301 states and 2776 transitions. Second operand 5 states. [2019-11-28 18:03:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:08,388 INFO L93 Difference]: Finished difference Result 1448 states and 3045 transitions. [2019-11-28 18:03:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:03:08,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 18:03:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:08,394 INFO L225 Difference]: With dead ends: 1448 [2019-11-28 18:03:08,394 INFO L226 Difference]: Without dead ends: 1448 [2019-11-28 18:03:08,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-11-28 18:03:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1311. [2019-11-28 18:03:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-28 18:03:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 2798 transitions. [2019-11-28 18:03:08,424 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 2798 transitions. Word has length 51 [2019-11-28 18:03:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:08,426 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 2798 transitions. [2019-11-28 18:03:08,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2798 transitions. [2019-11-28 18:03:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:03:08,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:08,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:08,431 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1151208547, now seen corresponding path program 3 times [2019-11-28 18:03:08,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:08,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525972833] [2019-11-28 18:03:08,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:08,648 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:03:08,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525972833] [2019-11-28 18:03:08,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:08,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:08,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856956389] [2019-11-28 18:03:08,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:08,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:08,652 INFO L87 Difference]: Start difference. First operand 1311 states and 2798 transitions. Second operand 3 states. [2019-11-28 18:03:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:08,668 INFO L93 Difference]: Finished difference Result 1310 states and 2796 transitions. [2019-11-28 18:03:08,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:08,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:03:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:08,674 INFO L225 Difference]: With dead ends: 1310 [2019-11-28 18:03:08,674 INFO L226 Difference]: Without dead ends: 1310 [2019-11-28 18:03:08,674 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:03:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-11-28 18:03:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1097. [2019-11-28 18:03:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-28 18:03:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2386 transitions. [2019-11-28 18:03:08,697 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 2386 transitions. Word has length 51 [2019-11-28 18:03:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:08,698 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 2386 transitions. [2019-11-28 18:03:08,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 2386 transitions. [2019-11-28 18:03:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:03:08,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:08,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:08,702 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:08,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1483615416, now seen corresponding path program 1 times [2019-11-28 18:03:08,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:08,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546195071] [2019-11-28 18:03:08,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:09,203 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:03:09,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546195071] [2019-11-28 18:03:09,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:09,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:03:09,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534979018] [2019-11-28 18:03:09,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:03:09,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:03:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:03:09,207 INFO L87 Difference]: Start difference. First operand 1097 states and 2386 transitions. Second operand 13 states. [2019-11-28 18:03:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:10,963 INFO L93 Difference]: Finished difference Result 2839 states and 6047 transitions. [2019-11-28 18:03:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 18:03:10,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:03:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:10,970 INFO L225 Difference]: With dead ends: 2839 [2019-11-28 18:03:10,970 INFO L226 Difference]: Without dead ends: 2372 [2019-11-28 18:03:10,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-11-28 18:03:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-11-28 18:03:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1412. [2019-11-28 18:03:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-28 18:03:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3112 transitions. [2019-11-28 18:03:11,007 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3112 transitions. Word has length 52 [2019-11-28 18:03:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:11,008 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 3112 transitions. [2019-11-28 18:03:11,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:03:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3112 transitions. [2019-11-28 18:03:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:03:11,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:11,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:11,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1581116936, now seen corresponding path program 2 times [2019-11-28 18:03:11,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:11,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188496844] [2019-11-28 18:03:11,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:11,107 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:03:11,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188496844] [2019-11-28 18:03:11,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:11,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:03:11,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105407110] [2019-11-28 18:03:11,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:03:11,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:03:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:11,109 INFO L87 Difference]: Start difference. First operand 1412 states and 3112 transitions. Second operand 7 states. [2019-11-28 18:03:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:11,409 INFO L93 Difference]: Finished difference Result 2798 states and 5906 transitions. [2019-11-28 18:03:11,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:03:11,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:03:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:11,414 INFO L225 Difference]: With dead ends: 2798 [2019-11-28 18:03:11,415 INFO L226 Difference]: Without dead ends: 2007 [2019-11-28 18:03:11,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:03:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2019-11-28 18:03:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1163. [2019-11-28 18:03:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-11-28 18:03:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2519 transitions. [2019-11-28 18:03:11,446 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2519 transitions. Word has length 52 [2019-11-28 18:03:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:11,446 INFO L462 AbstractCegarLoop]: Abstraction has 1163 states and 2519 transitions. [2019-11-28 18:03:11,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:03:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2519 transitions. [2019-11-28 18:03:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:03:11,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:11,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:11,452 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash 529376956, now seen corresponding path program 3 times [2019-11-28 18:03:11,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:11,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112089787] [2019-11-28 18:03:11,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:11,596 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:03:11,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112089787] [2019-11-28 18:03:11,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:11,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:11,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435367662] [2019-11-28 18:03:11,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:11,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:11,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:11,599 INFO L87 Difference]: Start difference. First operand 1163 states and 2519 transitions. Second operand 4 states. [2019-11-28 18:03:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:11,656 INFO L93 Difference]: Finished difference Result 1419 states and 3053 transitions. [2019-11-28 18:03:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:11,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:03:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:11,661 INFO L225 Difference]: With dead ends: 1419 [2019-11-28 18:03:11,661 INFO L226 Difference]: Without dead ends: 1419 [2019-11-28 18:03:11,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:03:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-11-28 18:03:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1064. [2019-11-28 18:03:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-11-28 18:03:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2347 transitions. [2019-11-28 18:03:11,686 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2347 transitions. Word has length 52 [2019-11-28 18:03:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:11,687 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 2347 transitions. [2019-11-28 18:03:11,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2347 transitions. [2019-11-28 18:03:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:03:11,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:11,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:11,691 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 1 times [2019-11-28 18:03:11,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:11,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822553271] [2019-11-28 18:03:11,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:11,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:03:11,798 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:03:11,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$w_buff1~0_283 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t249~0.base_34|) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t249~0.base_34| 4) |v_#length_19|) (= v_~z$w_buff0~0_493 0) (= 0 |v_ULTIMATE.start_main_~#t249~0.offset_22|) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= (select .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34|) 0) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34| 1)) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34|) |v_ULTIMATE.start_main_~#t249~0.offset_22| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_31|, ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ULTIMATE.start_main_~#t249~0.base=|v_ULTIMATE.start_main_~#t249~0.base_34|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_~#t249~0.offset=|v_ULTIMATE.start_main_~#t249~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t250~0.base, ULTIMATE.start_main_~#t250~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t249~0.base, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t249~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:03:11,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~z$r_buff0_thd2~0_In38749276 ~z$r_buff1_thd2~0_Out38749276) (= 1 ~z$r_buff0_thd1~0_Out38749276) (= ~y~0_In38749276 ~__unbuffered_p0_EBX~0_Out38749276) (= ~z$r_buff1_thd0~0_Out38749276 ~z$r_buff0_thd0~0_In38749276) (= ~z$r_buff0_thd1~0_In38749276 ~z$r_buff1_thd1~0_Out38749276) (= ~x~0_Out38749276 ~__unbuffered_p0_EAX~0_Out38749276) (= 1 ~x~0_Out38749276) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In38749276 0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In38749276, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In38749276, ~y~0=~y~0_In38749276, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In38749276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In38749276} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out38749276, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In38749276, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out38749276, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out38749276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out38749276, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out38749276, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In38749276, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out38749276, ~y~0=~y~0_In38749276, ~x~0=~x~0_Out38749276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In38749276} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:03:11,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) |v_ULTIMATE.start_main_~#t250~0.offset_11| 1))) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t250~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t250~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t250~0.offset_11| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t250~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t250~0.base] because there is no mapped edge [2019-11-28 18:03:11,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In666608587 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out666608587| |P1Thread1of1ForFork1_#t~ite20_Out666608587|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In666608587 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In666608587 256)) .cse0) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In666608587 256))) (= (mod ~z$w_buff0_used~0_In666608587 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out666608587| ~z$w_buff0_used~0_In666608587)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out666608587| ~z$w_buff0_used~0_In666608587) (= |P1Thread1of1ForFork1_#t~ite20_In666608587| |P1Thread1of1ForFork1_#t~ite20_Out666608587|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666608587, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In666608587|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666608587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666608587, ~weak$$choice2~0=~weak$$choice2~0_In666608587, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666608587} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In666608587, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out666608587|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666608587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666608587, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out666608587|, ~weak$$choice2~0=~weak$$choice2~0_In666608587, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666608587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:03:11,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:03:11,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In838854405 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In838854405| |P1Thread1of1ForFork1_#t~ite29_Out838854405|) (= ~z$r_buff1_thd2~0_In838854405 |P1Thread1of1ForFork1_#t~ite30_Out838854405|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out838854405| |P1Thread1of1ForFork1_#t~ite30_Out838854405|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out838854405| ~z$r_buff1_thd2~0_In838854405) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In838854405 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In838854405 256)) (and (= (mod ~z$w_buff1_used~0_In838854405 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd2~0_In838854405 256)) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In838854405|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In838854405, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In838854405, ~z$w_buff1_used~0=~z$w_buff1_used~0_In838854405, ~weak$$choice2~0=~weak$$choice2~0_In838854405, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In838854405} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out838854405|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out838854405|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In838854405, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In838854405, ~z$w_buff1_used~0=~z$w_buff1_used~0_In838854405, ~weak$$choice2~0=~weak$$choice2~0_In838854405, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In838854405} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:03:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:03:11,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1437856806 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1437856806 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1437856806| |P1Thread1of1ForFork1_#t~ite32_Out1437856806|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In1437856806 |P1Thread1of1ForFork1_#t~ite32_Out1437856806|)) (and (not .cse0) (= ~z$w_buff1~0_In1437856806 |P1Thread1of1ForFork1_#t~ite32_Out1437856806|) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1437856806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437856806, ~z$w_buff1~0=~z$w_buff1~0_In1437856806, ~z~0=~z~0_In1437856806} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1437856806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437856806, ~z$w_buff1~0=~z$w_buff1~0_In1437856806, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1437856806|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1437856806|, ~z~0=~z~0_In1437856806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:03:11,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-373673813 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-373673813 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-373673813|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-373673813 |P1Thread1of1ForFork1_#t~ite34_Out-373673813|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-373673813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-373673813} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-373673813, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-373673813|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-373673813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:03:11,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-258352778 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-258352778 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-258352778 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-258352778 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-258352778|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-258352778| ~z$w_buff1_used~0_In-258352778) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-258352778, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-258352778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-258352778, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-258352778} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-258352778, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-258352778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-258352778, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-258352778|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-258352778} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:03:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In861944227 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In861944227 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out861944227| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out861944227| ~z$r_buff0_thd2~0_In861944227)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In861944227, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In861944227} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In861944227, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In861944227, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out861944227|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:03:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2140492353 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2140492353 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2140492353 |P0Thread1of1ForFork0_#t~ite5_Out-2140492353|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-2140492353| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140492353, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2140492353} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2140492353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140492353, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2140492353} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:03:11,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-648598097 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-648598097 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-648598097 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-648598097 256)))) (or (and (= ~z$w_buff1_used~0_In-648598097 |P0Thread1of1ForFork0_#t~ite6_Out-648598097|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-648598097|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-648598097, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-648598097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648598097, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-648598097} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-648598097|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648598097, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-648598097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648598097, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-648598097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:03:11,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1147258939 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1147258939 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1147258939 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1147258939 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1147258939| ~z$r_buff1_thd2~0_In1147258939) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite37_Out1147258939| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1147258939, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1147258939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147258939, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1147258939} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1147258939, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1147258939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147258939, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1147258939, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1147258939|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1464905957 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out1464905957 ~z$r_buff0_thd1~0_In1464905957)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1464905957 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1464905957 0)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1464905957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1464905957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1464905957, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1464905957|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1464905957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:03:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1293888579 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1293888579 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1293888579 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1293888579 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1293888579| ~z$r_buff1_thd1~0_In-1293888579) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1293888579| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1293888579, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1293888579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293888579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1293888579} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1293888579, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1293888579|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1293888579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293888579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1293888579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:03:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:03:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:03:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1386518375 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1386518375 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1386518375| ~z$w_buff1~0_In1386518375)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1386518375| ~z~0_In1386518375)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1386518375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1386518375, ~z$w_buff1~0=~z$w_buff1~0_In1386518375, ~z~0=~z~0_In1386518375} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1386518375|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1386518375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1386518375, ~z$w_buff1~0=~z$w_buff1~0_In1386518375, ~z~0=~z~0_In1386518375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:03:11,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:03:11,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In979837944 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In979837944 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In979837944 |ULTIMATE.start_main_#t~ite42_Out979837944|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out979837944| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In979837944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In979837944} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In979837944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In979837944, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out979837944|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:03:11,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1014800523 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1014800523 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1014800523 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1014800523 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1014800523| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1014800523 |ULTIMATE.start_main_#t~ite43_Out1014800523|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1014800523, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014800523, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1014800523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014800523} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1014800523, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014800523, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1014800523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014800523, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1014800523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:03:11,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1638684580 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1638684580 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1638684580 |ULTIMATE.start_main_#t~ite44_Out1638684580|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1638684580|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1638684580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1638684580} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1638684580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1638684580, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1638684580|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:03:11,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1794356104 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1794356104 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1794356104 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1794356104 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1794356104| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1794356104| ~z$r_buff1_thd0~0_In1794356104)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1794356104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1794356104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1794356104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794356104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1794356104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1794356104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1794356104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794356104, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1794356104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:03:11,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:03:11,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:03:11 BasicIcfg [2019-11-28 18:03:11,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:03:11,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:03:11,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:03:11,908 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:03:11,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:57" (3/4) ... [2019-11-28 18:03:11,912 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:03:11,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$w_buff1~0_283 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t249~0.base_34|) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t249~0.base_34| 4) |v_#length_19|) (= v_~z$w_buff0~0_493 0) (= 0 |v_ULTIMATE.start_main_~#t249~0.offset_22|) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= (select .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34|) 0) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t249~0.base_34| 1)) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t249~0.base_34|) |v_ULTIMATE.start_main_~#t249~0.offset_22| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_31|, ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ULTIMATE.start_main_~#t249~0.base=|v_ULTIMATE.start_main_~#t249~0.base_34|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_~#t249~0.offset=|v_ULTIMATE.start_main_~#t249~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t250~0.base, ULTIMATE.start_main_~#t250~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t249~0.base, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t249~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:03:11,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~z$r_buff0_thd2~0_In38749276 ~z$r_buff1_thd2~0_Out38749276) (= 1 ~z$r_buff0_thd1~0_Out38749276) (= ~y~0_In38749276 ~__unbuffered_p0_EBX~0_Out38749276) (= ~z$r_buff1_thd0~0_Out38749276 ~z$r_buff0_thd0~0_In38749276) (= ~z$r_buff0_thd1~0_In38749276 ~z$r_buff1_thd1~0_Out38749276) (= ~x~0_Out38749276 ~__unbuffered_p0_EAX~0_Out38749276) (= 1 ~x~0_Out38749276) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In38749276 0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In38749276, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In38749276, ~y~0=~y~0_In38749276, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In38749276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In38749276} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out38749276, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In38749276, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out38749276, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out38749276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out38749276, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out38749276, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In38749276, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out38749276, ~y~0=~y~0_In38749276, ~x~0=~x~0_Out38749276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In38749276} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:03:11,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) |v_ULTIMATE.start_main_~#t250~0.offset_11| 1))) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t250~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t250~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t250~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t250~0.offset_11| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t250~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t250~0.offset=|v_ULTIMATE.start_main_~#t250~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t250~0.base=|v_ULTIMATE.start_main_~#t250~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t250~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t250~0.base] because there is no mapped edge [2019-11-28 18:03:11,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In666608587 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out666608587| |P1Thread1of1ForFork1_#t~ite20_Out666608587|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In666608587 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In666608587 256)) .cse0) (and .cse0 (= 0 (mod ~z$r_buff1_thd2~0_In666608587 256))) (= (mod ~z$w_buff0_used~0_In666608587 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out666608587| ~z$w_buff0_used~0_In666608587)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out666608587| ~z$w_buff0_used~0_In666608587) (= |P1Thread1of1ForFork1_#t~ite20_In666608587| |P1Thread1of1ForFork1_#t~ite20_Out666608587|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666608587, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In666608587|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666608587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666608587, ~weak$$choice2~0=~weak$$choice2~0_In666608587, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666608587} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In666608587, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out666608587|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666608587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666608587, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out666608587|, ~weak$$choice2~0=~weak$$choice2~0_In666608587, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666608587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:03:11,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:03:11,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In838854405 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In838854405| |P1Thread1of1ForFork1_#t~ite29_Out838854405|) (= ~z$r_buff1_thd2~0_In838854405 |P1Thread1of1ForFork1_#t~ite30_Out838854405|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out838854405| |P1Thread1of1ForFork1_#t~ite30_Out838854405|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out838854405| ~z$r_buff1_thd2~0_In838854405) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In838854405 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In838854405 256)) (and (= (mod ~z$w_buff1_used~0_In838854405 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd2~0_In838854405 256)) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In838854405|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In838854405, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In838854405, ~z$w_buff1_used~0=~z$w_buff1_used~0_In838854405, ~weak$$choice2~0=~weak$$choice2~0_In838854405, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In838854405} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out838854405|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out838854405|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In838854405, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In838854405, ~z$w_buff1_used~0=~z$w_buff1_used~0_In838854405, ~weak$$choice2~0=~weak$$choice2~0_In838854405, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In838854405} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:03:11,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:03:11,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1437856806 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1437856806 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out1437856806| |P1Thread1of1ForFork1_#t~ite32_Out1437856806|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In1437856806 |P1Thread1of1ForFork1_#t~ite32_Out1437856806|)) (and (not .cse0) (= ~z$w_buff1~0_In1437856806 |P1Thread1of1ForFork1_#t~ite32_Out1437856806|) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1437856806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437856806, ~z$w_buff1~0=~z$w_buff1~0_In1437856806, ~z~0=~z~0_In1437856806} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1437856806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437856806, ~z$w_buff1~0=~z$w_buff1~0_In1437856806, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1437856806|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1437856806|, ~z~0=~z~0_In1437856806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:03:11,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-373673813 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-373673813 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-373673813|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-373673813 |P1Thread1of1ForFork1_#t~ite34_Out-373673813|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-373673813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-373673813} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-373673813, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-373673813|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-373673813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:03:11,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-258352778 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-258352778 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-258352778 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-258352778 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-258352778|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-258352778| ~z$w_buff1_used~0_In-258352778) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-258352778, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-258352778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-258352778, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-258352778} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-258352778, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-258352778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-258352778, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-258352778|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-258352778} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:03:11,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In861944227 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In861944227 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out861944227| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out861944227| ~z$r_buff0_thd2~0_In861944227)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In861944227, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In861944227} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In861944227, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In861944227, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out861944227|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:03:11,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2140492353 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2140492353 256) 0))) (or (and (= ~z$w_buff0_used~0_In-2140492353 |P0Thread1of1ForFork0_#t~ite5_Out-2140492353|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-2140492353| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140492353, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2140492353} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2140492353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140492353, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2140492353} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:03:11,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-648598097 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-648598097 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-648598097 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-648598097 256)))) (or (and (= ~z$w_buff1_used~0_In-648598097 |P0Thread1of1ForFork0_#t~ite6_Out-648598097|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-648598097|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-648598097, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-648598097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648598097, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-648598097} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-648598097|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648598097, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-648598097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648598097, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-648598097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:03:11,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1147258939 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1147258939 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1147258939 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1147258939 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1147258939| ~z$r_buff1_thd2~0_In1147258939) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite37_Out1147258939| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1147258939, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1147258939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147258939, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1147258939} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1147258939, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1147258939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147258939, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1147258939, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1147258939|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:11,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:11,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1464905957 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out1464905957 ~z$r_buff0_thd1~0_In1464905957)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1464905957 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1464905957 0)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1464905957, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1464905957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1464905957, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1464905957|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1464905957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:03:11,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1293888579 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1293888579 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1293888579 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-1293888579 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1293888579| ~z$r_buff1_thd1~0_In-1293888579) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1293888579| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1293888579, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1293888579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293888579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1293888579} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1293888579, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1293888579|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1293888579, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1293888579, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1293888579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:03:11,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:03:11,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:03:11,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1386518375 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1386518375 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1386518375| ~z$w_buff1~0_In1386518375)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1386518375| ~z~0_In1386518375)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1386518375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1386518375, ~z$w_buff1~0=~z$w_buff1~0_In1386518375, ~z~0=~z~0_In1386518375} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1386518375|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1386518375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1386518375, ~z$w_buff1~0=~z$w_buff1~0_In1386518375, ~z~0=~z~0_In1386518375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:03:11,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:03:11,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In979837944 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In979837944 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In979837944 |ULTIMATE.start_main_#t~ite42_Out979837944|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out979837944| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In979837944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In979837944} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In979837944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In979837944, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out979837944|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:03:11,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1014800523 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1014800523 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1014800523 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1014800523 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1014800523| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1014800523 |ULTIMATE.start_main_#t~ite43_Out1014800523|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1014800523, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014800523, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1014800523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014800523} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1014800523, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014800523, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1014800523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014800523, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1014800523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:03:11,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1638684580 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1638684580 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1638684580 |ULTIMATE.start_main_#t~ite44_Out1638684580|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1638684580|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1638684580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1638684580} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1638684580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1638684580, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1638684580|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:03:11,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1794356104 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1794356104 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1794356104 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1794356104 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1794356104| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1794356104| ~z$r_buff1_thd0~0_In1794356104)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1794356104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1794356104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1794356104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794356104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1794356104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1794356104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1794356104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794356104, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1794356104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:03:11,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:03:12,066 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:03:12,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:03:12,071 INFO L168 Benchmark]: Toolchain (without parser) took 16644.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.2 MB). Free memory was 956.3 MB in the beginning and 909.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 492.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:12,071 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:03:12,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:12,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.22 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:03:12,073 INFO L168 Benchmark]: Boogie Preprocessor took 45.28 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:03:12,073 INFO L168 Benchmark]: RCFGBuilder took 871.08 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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:12,073 INFO L168 Benchmark]: TraceAbstraction took 14747.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 934.1 MB in the end (delta: 122.5 MB). Peak memory consumption was 428.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:12,074 INFO L168 Benchmark]: Witness Printer took 161.12 ms. Allocated memory is still 1.5 GB. Free memory was 934.1 MB in the beginning and 909.9 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:12,076 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.87 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 748.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.22 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 45.28 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 871.08 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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14747.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 934.1 MB in the end (delta: 122.5 MB). Peak memory consumption was 428.2 MB. Max. memory is 11.5 GB. * Witness Printer took 161.12 ms. Allocated memory is still 1.5 GB. Free memory was 934.1 MB in the beginning and 909.9 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t249, ((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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2127 SDtfs, 1740 SDslu, 5611 SDs, 0 SdLazy, 2991 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 20 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 4877 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 128932 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...