./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81cd4bc5617f253a3f62b3fe752fd9af08ab147d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:14:37,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:37,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:37,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:37,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:37,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:37,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:37,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:37,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:37,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:37,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:37,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:37,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:37,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:37,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:37,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:37,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:37,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:37,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:37,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:37,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:37,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:37,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:37,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:37,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:37,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:37,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:37,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:37,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:37,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:37,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:37,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:37,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:37,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:37,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:37,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:37,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:37,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:37,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:37,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:37,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:37,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:14:37,201 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:37,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:37,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:37,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:37,203 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:37,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:37,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:37,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:37,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:37,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:37,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:37,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:37,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:37,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:37,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:37,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:37,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:37,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:37,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:37,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:37,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:37,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:37,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:37,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:37,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:37,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:37,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:37,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:37,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:37,210 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 -> 81cd4bc5617f253a3f62b3fe752fd9af08ab147d [2019-11-28 18:14:37,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:37,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:37,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:37,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:37,551 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:37,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i [2019-11-28 18:14:37,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7af4678/106ed0311b8647a08b092e6fbcedd896/FLAG384246223 [2019-11-28 18:14:38,196 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:38,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i [2019-11-28 18:14:38,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7af4678/106ed0311b8647a08b092e6fbcedd896/FLAG384246223 [2019-11-28 18:14:38,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7af4678/106ed0311b8647a08b092e6fbcedd896 [2019-11-28 18:14:38,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:38,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:38,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:38,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:38,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:38,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:38" (1/1) ... [2019-11-28 18:14:38,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288faa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:38, skipping insertion in model container [2019-11-28 18:14:38,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:38" (1/1) ... [2019-11-28 18:14:38,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:38,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:39,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:39,120 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:39,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:39,281 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:39,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39 WrapperNode [2019-11-28 18:14:39,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:39,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:39,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:39,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:39,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:39,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:39,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:39,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:39,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... [2019-11-28 18:14:39,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:39,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:39,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:39,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:39,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:39,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:14:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:14:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-11-28 18:14:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-11-28 18:14:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:39,490 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:14:40,236 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:14:40,236 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:14:40,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:40 BoogieIcfgContainer [2019-11-28 18:14:40,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:14:40,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:14:40,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:14:40,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:14:40,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:38" (1/3) ... [2019-11-28 18:14:40,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476b208d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:40, skipping insertion in model container [2019-11-28 18:14:40,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:39" (2/3) ... [2019-11-28 18:14:40,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476b208d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:40, skipping insertion in model container [2019-11-28 18:14:40,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:40" (3/3) ... [2019-11-28 18:14:40,247 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_rmo.opt.i [2019-11-28 18:14:40,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:14:40,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:14:40,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:14:40,264 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:14:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,309 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,309 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,332 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,332 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,332 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,332 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,332 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,333 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,333 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,333 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,334 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,334 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,334 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,334 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:40,361 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-28 18:14:40,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:14:40,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:14:40,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:14:40,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:14:40,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:14:40,380 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:14:40,380 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:14:40,380 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:14:40,407 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-11-28 18:14:40,409 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-11-28 18:14:40,538 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-11-28 18:14:40,538 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:40,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-11-28 18:14:40,581 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-11-28 18:14:40,632 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-11-28 18:14:40,632 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:40,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-11-28 18:14:40,658 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-11-28 18:14:40,659 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:14:45,313 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 18:14:45,432 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 18:14:45,747 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-28 18:14:46,094 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-11-28 18:14:46,234 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 18:14:46,253 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-11-28 18:14:46,254 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-11-28 18:14:46,258 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-11-28 18:14:48,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-11-28 18:14:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-11-28 18:14:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 18:14:48,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:48,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:48,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-11-28 18:14:48,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:48,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576733627] [2019-11-28 18:14:48,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:48,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576733627] [2019-11-28 18:14:48,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:48,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:14:48,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423240576] [2019-11-28 18:14:48,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:48,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:48,945 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-11-28 18:14:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:49,564 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-11-28 18:14:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:49,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 18:14:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:49,784 INFO L225 Difference]: With dead ends: 26518 [2019-11-28 18:14:49,785 INFO L226 Difference]: Without dead ends: 24958 [2019-11-28 18:14:49,787 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:14:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-11-28 18:14:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-11-28 18:14:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-11-28 18:14:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-11-28 18:14:51,285 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-11-28 18:14:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:51,287 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-11-28 18:14:51,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-11-28 18:14:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 18:14:51,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:51,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:51,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-11-28 18:14:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:51,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471969349] [2019-11-28 18:14:51,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:51,367 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:14:51,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471969349] [2019-11-28 18:14:51,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:51,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:51,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88422374] [2019-11-28 18:14:51,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:51,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:51,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:51,370 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-11-28 18:14:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:51,679 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-11-28 18:14:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:51,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 18:14:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:51,768 INFO L225 Difference]: With dead ends: 19953 [2019-11-28 18:14:51,769 INFO L226 Difference]: Without dead ends: 19953 [2019-11-28 18:14:51,770 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:14:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-11-28 18:14:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-11-28 18:14:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-11-28 18:14:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-11-28 18:14:52,936 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-11-28 18:14:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:52,937 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-11-28 18:14:52,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-11-28 18:14:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:14:52,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:52,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:52,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:52,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-11-28 18:14:52,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:52,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417062144] [2019-11-28 18:14:52,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:53,039 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:14:53,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417062144] [2019-11-28 18:14:53,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:53,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:53,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174672822] [2019-11-28 18:14:53,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:53,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:53,041 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-11-28 18:14:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:53,115 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-11-28 18:14:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:53,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:14:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:53,152 INFO L225 Difference]: With dead ends: 9211 [2019-11-28 18:14:53,152 INFO L226 Difference]: Without dead ends: 9211 [2019-11-28 18:14:53,153 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:14:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-11-28 18:14:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-11-28 18:14:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-11-28 18:14:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-11-28 18:14:53,431 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-11-28 18:14:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:53,431 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-11-28 18:14:53,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-11-28 18:14:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:14:53,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:53,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:53,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:53,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-11-28 18:14:53,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:53,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527971105] [2019-11-28 18:14:53,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:53,567 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:14:53,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527971105] [2019-11-28 18:14:53,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:53,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:53,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056059656] [2019-11-28 18:14:53,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:53,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:53,570 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 5 states. [2019-11-28 18:14:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:53,633 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-11-28 18:14:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:53,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 18:14:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:53,644 INFO L225 Difference]: With dead ends: 2716 [2019-11-28 18:14:53,644 INFO L226 Difference]: Without dead ends: 2716 [2019-11-28 18:14:53,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-11-28 18:14:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-11-28 18:14:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-11-28 18:14:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-11-28 18:14:53,707 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-11-28 18:14:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:53,707 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-11-28 18:14:53,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-11-28 18:14:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:14:53,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:53,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:53,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-11-28 18:14:53,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:53,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66313689] [2019-11-28 18:14:53,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:53,861 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:14:53,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66313689] [2019-11-28 18:14:53,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:53,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:53,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095766659] [2019-11-28 18:14:53,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:53,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:53,864 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 4 states. [2019-11-28 18:14:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:54,064 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-11-28 18:14:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:54,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:14:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:54,076 INFO L225 Difference]: With dead ends: 3607 [2019-11-28 18:14:54,077 INFO L226 Difference]: Without dead ends: 3607 [2019-11-28 18:14:54,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-11-28 18:14:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-11-28 18:14:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-11-28 18:14:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-11-28 18:14:54,172 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-11-28 18:14:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:54,173 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-11-28 18:14:54,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-11-28 18:14:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:54,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:54,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:54,185 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-11-28 18:14:54,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:54,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085413222] [2019-11-28 18:14:54,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:54,351 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:14:54,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085413222] [2019-11-28 18:14:54,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:54,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:54,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135415284] [2019-11-28 18:14:54,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:54,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:54,354 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 5 states. [2019-11-28 18:14:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:54,765 INFO L93 Difference]: Finished difference Result 4994 states and 14891 transitions. [2019-11-28 18:14:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:14:54,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 18:14:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:54,779 INFO L225 Difference]: With dead ends: 4994 [2019-11-28 18:14:54,779 INFO L226 Difference]: Without dead ends: 4994 [2019-11-28 18:14:54,779 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:14:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-11-28 18:14:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4302. [2019-11-28 18:14:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4302 states. [2019-11-28 18:14:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 12982 transitions. [2019-11-28 18:14:54,912 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 12982 transitions. Word has length 32 [2019-11-28 18:14:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:54,913 INFO L462 AbstractCegarLoop]: Abstraction has 4302 states and 12982 transitions. [2019-11-28 18:14:54,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 12982 transitions. [2019-11-28 18:14:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:54,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:54,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:54,925 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-11-28 18:14:54,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:54,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23142208] [2019-11-28 18:14:54,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:54,983 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:14:54,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23142208] [2019-11-28 18:14:54,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:54,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:54,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91046801] [2019-11-28 18:14:54,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:54,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:54,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:54,987 INFO L87 Difference]: Start difference. First operand 4302 states and 12982 transitions. Second operand 3 states. [2019-11-28 18:14:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:55,051 INFO L93 Difference]: Finished difference Result 6260 states and 18717 transitions. [2019-11-28 18:14:55,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:55,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 18:14:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:55,066 INFO L225 Difference]: With dead ends: 6260 [2019-11-28 18:14:55,067 INFO L226 Difference]: Without dead ends: 6260 [2019-11-28 18:14:55,067 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:14:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-11-28 18:14:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 5218. [2019-11-28 18:14:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-11-28 18:14:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 15792 transitions. [2019-11-28 18:14:55,188 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 15792 transitions. Word has length 32 [2019-11-28 18:14:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:55,189 INFO L462 AbstractCegarLoop]: Abstraction has 5218 states and 15792 transitions. [2019-11-28 18:14:55,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 15792 transitions. [2019-11-28 18:14:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:55,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:55,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:55,202 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-11-28 18:14:55,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:55,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123949629] [2019-11-28 18:14:55,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:55,672 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:14:55,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123949629] [2019-11-28 18:14:55,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:55,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:55,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595342150] [2019-11-28 18:14:55,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:55,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:55,674 INFO L87 Difference]: Start difference. First operand 5218 states and 15792 transitions. Second operand 3 states. [2019-11-28 18:14:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:55,729 INFO L93 Difference]: Finished difference Result 6260 states and 18336 transitions. [2019-11-28 18:14:55,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:55,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 18:14:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:55,744 INFO L225 Difference]: With dead ends: 6260 [2019-11-28 18:14:55,744 INFO L226 Difference]: Without dead ends: 6260 [2019-11-28 18:14:55,745 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:14:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-11-28 18:14:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 5194. [2019-11-28 18:14:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-11-28 18:14:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 15365 transitions. [2019-11-28 18:14:55,863 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 15365 transitions. Word has length 32 [2019-11-28 18:14:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:55,863 INFO L462 AbstractCegarLoop]: Abstraction has 5194 states and 15365 transitions. [2019-11-28 18:14:55,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 15365 transitions. [2019-11-28 18:14:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:55,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:55,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:55,878 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-11-28 18:14:55,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:55,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165398874] [2019-11-28 18:14:55,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:56,014 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:14:56,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165398874] [2019-11-28 18:14:56,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:56,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:56,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976083852] [2019-11-28 18:14:56,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:56,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:56,017 INFO L87 Difference]: Start difference. First operand 5194 states and 15365 transitions. Second operand 6 states. [2019-11-28 18:14:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:56,430 INFO L93 Difference]: Finished difference Result 8587 states and 24799 transitions. [2019-11-28 18:14:56,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:14:56,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 18:14:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:56,446 INFO L225 Difference]: With dead ends: 8587 [2019-11-28 18:14:56,447 INFO L226 Difference]: Without dead ends: 8585 [2019-11-28 18:14:56,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:14:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2019-11-28 18:14:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 5350. [2019-11-28 18:14:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5350 states. [2019-11-28 18:14:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5350 states to 5350 states and 15797 transitions. [2019-11-28 18:14:56,588 INFO L78 Accepts]: Start accepts. Automaton has 5350 states and 15797 transitions. Word has length 32 [2019-11-28 18:14:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:56,589 INFO L462 AbstractCegarLoop]: Abstraction has 5350 states and 15797 transitions. [2019-11-28 18:14:56,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5350 states and 15797 transitions. [2019-11-28 18:14:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:56,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:56,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:56,601 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash -351630546, now seen corresponding path program 1 times [2019-11-28 18:14:56,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:56,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727720305] [2019-11-28 18:14:56,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:56,700 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:14:56,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727720305] [2019-11-28 18:14:56,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:56,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:56,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991667980] [2019-11-28 18:14:56,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:56,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:56,702 INFO L87 Difference]: Start difference. First operand 5350 states and 15797 transitions. Second operand 4 states. [2019-11-28 18:14:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:56,767 INFO L93 Difference]: Finished difference Result 10587 states and 28594 transitions. [2019-11-28 18:14:56,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:56,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 18:14:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:56,781 INFO L225 Difference]: With dead ends: 10587 [2019-11-28 18:14:56,781 INFO L226 Difference]: Without dead ends: 7697 [2019-11-28 18:14:56,782 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:14:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2019-11-28 18:14:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 6560. [2019-11-28 18:14:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6560 states. [2019-11-28 18:14:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 17034 transitions. [2019-11-28 18:14:56,918 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 17034 transitions. Word has length 33 [2019-11-28 18:14:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:56,918 INFO L462 AbstractCegarLoop]: Abstraction has 6560 states and 17034 transitions. [2019-11-28 18:14:56,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 17034 transitions. [2019-11-28 18:14:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:56,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:56,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:56,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1277869158, now seen corresponding path program 1 times [2019-11-28 18:14:56,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:56,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085428396] [2019-11-28 18:14:56,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:57,092 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:14:57,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085428396] [2019-11-28 18:14:57,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:57,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:57,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009640265] [2019-11-28 18:14:57,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:57,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:57,096 INFO L87 Difference]: Start difference. First operand 6560 states and 17034 transitions. Second operand 6 states. [2019-11-28 18:14:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:57,502 INFO L93 Difference]: Finished difference Result 8933 states and 22621 transitions. [2019-11-28 18:14:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:14:57,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-28 18:14:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:57,516 INFO L225 Difference]: With dead ends: 8933 [2019-11-28 18:14:57,516 INFO L226 Difference]: Without dead ends: 8850 [2019-11-28 18:14:57,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:14:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8850 states. [2019-11-28 18:14:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8850 to 6393. [2019-11-28 18:14:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6393 states. [2019-11-28 18:14:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 16642 transitions. [2019-11-28 18:14:57,660 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 16642 transitions. Word has length 33 [2019-11-28 18:14:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:57,660 INFO L462 AbstractCegarLoop]: Abstraction has 6393 states and 16642 transitions. [2019-11-28 18:14:57,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 16642 transitions. [2019-11-28 18:14:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:57,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:57,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:57,676 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1393084622, now seen corresponding path program 2 times [2019-11-28 18:14:57,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:57,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500689486] [2019-11-28 18:14:57,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:57,808 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:14:57,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500689486] [2019-11-28 18:14:57,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:57,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:57,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472787509] [2019-11-28 18:14:57,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:57,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:57,812 INFO L87 Difference]: Start difference. First operand 6393 states and 16642 transitions. Second operand 4 states. [2019-11-28 18:14:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:57,867 INFO L93 Difference]: Finished difference Result 10242 states and 25965 transitions. [2019-11-28 18:14:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:57,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 18:14:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:57,873 INFO L225 Difference]: With dead ends: 10242 [2019-11-28 18:14:57,873 INFO L226 Difference]: Without dead ends: 3188 [2019-11-28 18:14:57,874 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:14:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2019-11-28 18:14:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3129. [2019-11-28 18:14:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-11-28 18:14:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 6967 transitions. [2019-11-28 18:14:57,932 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 6967 transitions. Word has length 33 [2019-11-28 18:14:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:57,933 INFO L462 AbstractCegarLoop]: Abstraction has 3129 states and 6967 transitions. [2019-11-28 18:14:57,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 6967 transitions. [2019-11-28 18:14:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 18:14:57,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:57,941 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] [2019-11-28 18:14:57,942 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1312613516, now seen corresponding path program 1 times [2019-11-28 18:14:57,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:57,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946607044] [2019-11-28 18:14:57,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:58,095 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:14:58,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946607044] [2019-11-28 18:14:58,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:58,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:58,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117235457] [2019-11-28 18:14:58,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:58,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:58,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:58,103 INFO L87 Difference]: Start difference. First operand 3129 states and 6967 transitions. Second operand 5 states. [2019-11-28 18:14:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:58,182 INFO L93 Difference]: Finished difference Result 4826 states and 10808 transitions. [2019-11-28 18:14:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:14:58,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 18:14:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:58,188 INFO L225 Difference]: With dead ends: 4826 [2019-11-28 18:14:58,188 INFO L226 Difference]: Without dead ends: 2951 [2019-11-28 18:14:58,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-11-28 18:14:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2903. [2019-11-28 18:14:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2019-11-28 18:14:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 6357 transitions. [2019-11-28 18:14:58,251 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 6357 transitions. Word has length 34 [2019-11-28 18:14:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:58,252 INFO L462 AbstractCegarLoop]: Abstraction has 2903 states and 6357 transitions. [2019-11-28 18:14:58,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 6357 transitions. [2019-11-28 18:14:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 18:14:58,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:58,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:58,258 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash -926430000, now seen corresponding path program 2 times [2019-11-28 18:14:58,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:58,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641203842] [2019-11-28 18:14:58,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:58,361 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:14:58,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641203842] [2019-11-28 18:14:58,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:58,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:58,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993244676] [2019-11-28 18:14:58,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:58,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:58,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:58,364 INFO L87 Difference]: Start difference. First operand 2903 states and 6357 transitions. Second operand 6 states. [2019-11-28 18:14:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:58,404 INFO L93 Difference]: Finished difference Result 1910 states and 3971 transitions. [2019-11-28 18:14:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:14:58,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 18:14:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:58,406 INFO L225 Difference]: With dead ends: 1910 [2019-11-28 18:14:58,406 INFO L226 Difference]: Without dead ends: 855 [2019-11-28 18:14:58,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-28 18:14:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 831. [2019-11-28 18:14:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-28 18:14:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1726 transitions. [2019-11-28 18:14:58,421 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1726 transitions. Word has length 34 [2019-11-28 18:14:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:58,421 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1726 transitions. [2019-11-28 18:14:58,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1726 transitions. [2019-11-28 18:14:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 18:14:58,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:58,424 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] [2019-11-28 18:14:58,424 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:58,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:58,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1592431234, now seen corresponding path program 1 times [2019-11-28 18:14:58,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:58,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392450003] [2019-11-28 18:14:58,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:58,549 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:14:58,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392450003] [2019-11-28 18:14:58,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:58,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:14:58,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200988286] [2019-11-28 18:14:58,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:14:58,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:14:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:58,553 INFO L87 Difference]: Start difference. First operand 831 states and 1726 transitions. Second operand 7 states. [2019-11-28 18:14:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:59,290 INFO L93 Difference]: Finished difference Result 1238 states and 2505 transitions. [2019-11-28 18:14:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:14:59,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-28 18:14:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:59,292 INFO L225 Difference]: With dead ends: 1238 [2019-11-28 18:14:59,293 INFO L226 Difference]: Without dead ends: 1238 [2019-11-28 18:14:59,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:14:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-11-28 18:14:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 843. [2019-11-28 18:14:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-11-28 18:14:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1754 transitions. [2019-11-28 18:14:59,313 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1754 transitions. Word has length 47 [2019-11-28 18:14:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:59,314 INFO L462 AbstractCegarLoop]: Abstraction has 843 states and 1754 transitions. [2019-11-28 18:14:59,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:14:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1754 transitions. [2019-11-28 18:14:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 18:14:59,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:59,317 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] [2019-11-28 18:14:59,321 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1030854498, now seen corresponding path program 2 times [2019-11-28 18:14:59,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:59,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001179605] [2019-11-28 18:14:59,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:59,390 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:14:59,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001179605] [2019-11-28 18:14:59,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:59,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701803812] [2019-11-28 18:14:59,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:59,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:59,394 INFO L87 Difference]: Start difference. First operand 843 states and 1754 transitions. Second operand 3 states. [2019-11-28 18:14:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:59,406 INFO L93 Difference]: Finished difference Result 841 states and 1749 transitions. [2019-11-28 18:14:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:59,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-28 18:14:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:59,408 INFO L225 Difference]: With dead ends: 841 [2019-11-28 18:14:59,409 INFO L226 Difference]: Without dead ends: 841 [2019-11-28 18:14:59,409 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:14:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-11-28 18:14:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 710. [2019-11-28 18:14:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-11-28 18:14:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1495 transitions. [2019-11-28 18:14:59,424 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1495 transitions. Word has length 47 [2019-11-28 18:14:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:59,424 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 1495 transitions. [2019-11-28 18:14:59,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1495 transitions. [2019-11-28 18:14:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:59,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:59,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:59,427 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 616592385, now seen corresponding path program 1 times [2019-11-28 18:14:59,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:59,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622469450] [2019-11-28 18:14:59,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:59,558 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:14:59,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622469450] [2019-11-28 18:14:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:14:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258814898] [2019-11-28 18:14:59,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:14:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:14:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:59,561 INFO L87 Difference]: Start difference. First operand 710 states and 1495 transitions. Second operand 7 states. [2019-11-28 18:14:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:59,834 INFO L93 Difference]: Finished difference Result 1099 states and 2259 transitions. [2019-11-28 18:14:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:14:59,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-28 18:14:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:59,837 INFO L225 Difference]: With dead ends: 1099 [2019-11-28 18:14:59,837 INFO L226 Difference]: Without dead ends: 753 [2019-11-28 18:14:59,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:14:59,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-11-28 18:14:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 711. [2019-11-28 18:14:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-11-28 18:14:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1472 transitions. [2019-11-28 18:14:59,851 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1472 transitions. Word has length 48 [2019-11-28 18:14:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:59,852 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 1472 transitions. [2019-11-28 18:14:59,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:14:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1472 transitions. [2019-11-28 18:14:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:59,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:59,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:59,855 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 2 times [2019-11-28 18:14:59,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:59,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700283484] [2019-11-28 18:14:59,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:59,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:14:59,976 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:14:59,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1077~0.base_46|) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46| 1)) (= 0 v_~z$r_buff1_thd4~0_128) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46|) |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0)) |v_#memory_int_25|) (= |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46|) 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1077~0.base_46| 4)) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_45|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_29|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_30|, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_19|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_46|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1080~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:14:59,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-11-28 18:14:59,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:59,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-11-28 18:14:59,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:14:59,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-11-28 18:14:59,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-11-28 18:14:59,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1361746149 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite8_In1361746149| |P2Thread1of1ForFork0_#t~ite8_Out1361746149|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite9_Out1361746149| ~z$w_buff0~0_In1361746149)) (and (= |P2Thread1of1ForFork0_#t~ite8_Out1361746149| |P2Thread1of1ForFork0_#t~ite9_Out1361746149|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1361746149 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1361746149 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1361746149 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1361746149 256))))) (= |P2Thread1of1ForFork0_#t~ite8_Out1361746149| ~z$w_buff0~0_In1361746149) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In1361746149|, ~z$w_buff0~0=~z$w_buff0~0_In1361746149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1361746149, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1361746149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1361746149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1361746149, ~weak$$choice2~0=~weak$$choice2~0_In1361746149} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out1361746149|, ~z$w_buff0~0=~z$w_buff0~0_In1361746149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1361746149, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1361746149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1361746149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1361746149, ~weak$$choice2~0=~weak$$choice2~0_In1361746149, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out1361746149|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-11-28 18:14:59,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In179836586 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out179836586| |P2Thread1of1ForFork0_#t~ite11_Out179836586|) .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out179836586| ~z$w_buff1~0_In179836586) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In179836586 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In179836586 256) 0)) (= (mod ~z$w_buff0_used~0_In179836586 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In179836586 256)))))) (and (= |P2Thread1of1ForFork0_#t~ite12_Out179836586| ~z$w_buff1~0_In179836586) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_In179836586| |P2Thread1of1ForFork0_#t~ite11_Out179836586|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In179836586, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In179836586|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179836586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179836586, ~z$w_buff1~0=~z$w_buff1~0_In179836586, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179836586, ~weak$$choice2~0=~weak$$choice2~0_In179836586} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out179836586|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179836586, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out179836586|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179836586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179836586, ~z$w_buff1~0=~z$w_buff1~0_In179836586, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179836586, ~weak$$choice2~0=~weak$$choice2~0_In179836586} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-11-28 18:14:59,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1481564841 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_In1481564841| |P2Thread1of1ForFork0_#t~ite14_Out1481564841|) (= ~z$w_buff0_used~0_In1481564841 |P2Thread1of1ForFork0_#t~ite15_Out1481564841|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out1481564841| ~z$w_buff0_used~0_In1481564841) .cse0 (= |P2Thread1of1ForFork0_#t~ite14_Out1481564841| |P2Thread1of1ForFork0_#t~ite15_Out1481564841|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1481564841 256)))) (or (= (mod ~z$w_buff0_used~0_In1481564841 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1481564841 256) 0)) (and (= (mod ~z$w_buff1_used~0_In1481564841 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In1481564841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1481564841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1481564841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1481564841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1481564841, ~weak$$choice2~0=~weak$$choice2~0_In1481564841} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1481564841|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out1481564841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1481564841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1481564841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1481564841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1481564841, ~weak$$choice2~0=~weak$$choice2~0_In1481564841} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-11-28 18:14:59,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:14:59,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1307247626 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1307247626 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out1307247626| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out1307247626| ~z$w_buff0_used~0_In1307247626)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1307247626, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1307247626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1307247626, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1307247626|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1307247626} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:14:59,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:15:00,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-960610863 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-960610863 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-960610863 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-960610863 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite29_Out-960610863| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite29_Out-960610863| ~z$w_buff1_used~0_In-960610863)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-960610863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-960610863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-960610863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-960610863} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-960610863, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-960610863|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-960610863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-960610863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-960610863} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:15:00,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out820485753 ~z$r_buff0_thd4~0_In820485753)) (.cse2 (= (mod ~z$w_buff0_used~0_In820485753 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In820485753 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out820485753 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In820485753, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In820485753} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In820485753, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out820485753, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out820485753|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:15:00,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In1834491369 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1834491369 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1834491369 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1834491369 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out1834491369| 0)) (and (= |P3Thread1of1ForFork1_#t~ite31_Out1834491369| ~z$r_buff1_thd4~0_In1834491369) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1834491369, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1834491369, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1834491369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1834491369} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1834491369, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1834491369, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1834491369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1834491369, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1834491369|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:15:00,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:15:00,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:15:00,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-2135764829 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2135764829 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-2135764829| ~z~0_In-2135764829)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-2135764829| ~z$w_buff1~0_In-2135764829) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2135764829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2135764829, ~z$w_buff1~0=~z$w_buff1~0_In-2135764829, ~z~0=~z~0_In-2135764829} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2135764829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2135764829, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2135764829|, ~z$w_buff1~0=~z$w_buff1~0_In-2135764829, ~z~0=~z~0_In-2135764829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:15:00,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-11-28 18:15:00,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-742135637 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-742135637 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-742135637 |ULTIMATE.start_main_#t~ite38_Out-742135637|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-742135637| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-742135637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-742135637} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-742135637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-742135637, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-742135637|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:15:00,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1173059718 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1173059718 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1173059718 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1173059718 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1173059718| ~z$w_buff1_used~0_In1173059718) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1173059718| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1173059718, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1173059718, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1173059718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173059718} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1173059718, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1173059718|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1173059718, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1173059718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173059718} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:15:00,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1530832157 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1530832157 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1530832157 |ULTIMATE.start_main_#t~ite40_Out-1530832157|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1530832157| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1530832157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530832157} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1530832157, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1530832157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530832157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:15:00,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-514272286 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-514272286 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-514272286 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-514272286 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-514272286|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-514272286 |ULTIMATE.start_main_#t~ite41_Out-514272286|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514272286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514272286, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-514272286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514272286} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-514272286|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514272286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514272286, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-514272286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514272286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-11-28 18:15:00,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:00,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:15:00 BasicIcfg [2019-11-28 18:15:00,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:15:00,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:15:00,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:15:00,099 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:15:00,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:40" (3/4) ... [2019-11-28 18:15:00,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:15:00,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1077~0.base_46|) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46| 1)) (= 0 v_~z$r_buff1_thd4~0_128) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46|) |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0)) |v_#memory_int_25|) (= |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46|) 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1077~0.base_46| 4)) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_45|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_29|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_30|, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_19|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_46|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1080~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:15:00,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-11-28 18:15:00,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:15:00,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-11-28 18:15:00,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:15:00,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-11-28 18:15:00,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:00,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1361746149 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite8_In1361746149| |P2Thread1of1ForFork0_#t~ite8_Out1361746149|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite9_Out1361746149| ~z$w_buff0~0_In1361746149)) (and (= |P2Thread1of1ForFork0_#t~ite8_Out1361746149| |P2Thread1of1ForFork0_#t~ite9_Out1361746149|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1361746149 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1361746149 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1361746149 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1361746149 256))))) (= |P2Thread1of1ForFork0_#t~ite8_Out1361746149| ~z$w_buff0~0_In1361746149) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In1361746149|, ~z$w_buff0~0=~z$w_buff0~0_In1361746149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1361746149, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1361746149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1361746149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1361746149, ~weak$$choice2~0=~weak$$choice2~0_In1361746149} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out1361746149|, ~z$w_buff0~0=~z$w_buff0~0_In1361746149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1361746149, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1361746149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1361746149, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1361746149, ~weak$$choice2~0=~weak$$choice2~0_In1361746149, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out1361746149|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-11-28 18:15:00,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In179836586 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out179836586| |P2Thread1of1ForFork0_#t~ite11_Out179836586|) .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out179836586| ~z$w_buff1~0_In179836586) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In179836586 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In179836586 256) 0)) (= (mod ~z$w_buff0_used~0_In179836586 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In179836586 256)))))) (and (= |P2Thread1of1ForFork0_#t~ite12_Out179836586| ~z$w_buff1~0_In179836586) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_In179836586| |P2Thread1of1ForFork0_#t~ite11_Out179836586|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In179836586, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In179836586|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179836586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179836586, ~z$w_buff1~0=~z$w_buff1~0_In179836586, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179836586, ~weak$$choice2~0=~weak$$choice2~0_In179836586} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out179836586|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179836586, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out179836586|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179836586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179836586, ~z$w_buff1~0=~z$w_buff1~0_In179836586, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179836586, ~weak$$choice2~0=~weak$$choice2~0_In179836586} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-11-28 18:15:00,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1481564841 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_In1481564841| |P2Thread1of1ForFork0_#t~ite14_Out1481564841|) (= ~z$w_buff0_used~0_In1481564841 |P2Thread1of1ForFork0_#t~ite15_Out1481564841|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out1481564841| ~z$w_buff0_used~0_In1481564841) .cse0 (= |P2Thread1of1ForFork0_#t~ite14_Out1481564841| |P2Thread1of1ForFork0_#t~ite15_Out1481564841|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1481564841 256)))) (or (= (mod ~z$w_buff0_used~0_In1481564841 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1481564841 256) 0)) (and (= (mod ~z$w_buff1_used~0_In1481564841 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In1481564841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1481564841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1481564841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1481564841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1481564841, ~weak$$choice2~0=~weak$$choice2~0_In1481564841} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1481564841|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out1481564841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1481564841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1481564841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1481564841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1481564841, ~weak$$choice2~0=~weak$$choice2~0_In1481564841} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-11-28 18:15:00,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:15:00,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1307247626 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1307247626 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out1307247626| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out1307247626| ~z$w_buff0_used~0_In1307247626)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1307247626, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1307247626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1307247626, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1307247626|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1307247626} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:15:00,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:15:00,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-960610863 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-960610863 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-960610863 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-960610863 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite29_Out-960610863| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite29_Out-960610863| ~z$w_buff1_used~0_In-960610863)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-960610863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-960610863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-960610863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-960610863} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-960610863, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-960610863|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-960610863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-960610863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-960610863} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:15:00,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out820485753 ~z$r_buff0_thd4~0_In820485753)) (.cse2 (= (mod ~z$w_buff0_used~0_In820485753 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In820485753 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= ~z$r_buff0_thd4~0_Out820485753 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In820485753, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In820485753} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In820485753, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out820485753, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out820485753|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:15:00,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In1834491369 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1834491369 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1834491369 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1834491369 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out1834491369| 0)) (and (= |P3Thread1of1ForFork1_#t~ite31_Out1834491369| ~z$r_buff1_thd4~0_In1834491369) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1834491369, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1834491369, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1834491369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1834491369} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1834491369, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1834491369, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1834491369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1834491369, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1834491369|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:15:00,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:15:00,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:15:00,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-2135764829 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2135764829 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-2135764829| ~z~0_In-2135764829)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-2135764829| ~z$w_buff1~0_In-2135764829) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2135764829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2135764829, ~z$w_buff1~0=~z$w_buff1~0_In-2135764829, ~z~0=~z~0_In-2135764829} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2135764829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2135764829, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2135764829|, ~z$w_buff1~0=~z$w_buff1~0_In-2135764829, ~z~0=~z~0_In-2135764829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:15:00,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-11-28 18:15:00,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-742135637 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-742135637 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-742135637 |ULTIMATE.start_main_#t~ite38_Out-742135637|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-742135637| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-742135637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-742135637} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-742135637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-742135637, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-742135637|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:15:00,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1173059718 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1173059718 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1173059718 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1173059718 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1173059718| ~z$w_buff1_used~0_In1173059718) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1173059718| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1173059718, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1173059718, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1173059718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173059718} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1173059718, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1173059718|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1173059718, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1173059718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173059718} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:15:00,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1530832157 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1530832157 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1530832157 |ULTIMATE.start_main_#t~ite40_Out-1530832157|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1530832157| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1530832157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530832157} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1530832157, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1530832157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530832157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:15:00,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-514272286 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-514272286 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-514272286 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-514272286 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-514272286|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-514272286 |ULTIMATE.start_main_#t~ite41_Out-514272286|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514272286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514272286, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-514272286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514272286} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-514272286|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-514272286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-514272286, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-514272286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-514272286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-11-28 18:15:00,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:15:00,234 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:15:00,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:15:00,236 INFO L168 Benchmark]: Toolchain (without parser) took 21726.67 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 951.6 MB). Free memory was 953.6 MB in the beginning and 614.9 MB in the end (delta: 338.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-28 18:15:00,237 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:00,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -114.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:00,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:00,238 INFO L168 Benchmark]: Boogie Preprocessor took 41.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:00,239 INFO L168 Benchmark]: RCFGBuilder took 839.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:00,240 INFO L168 Benchmark]: TraceAbstraction took 19857.46 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 849.9 MB). Free memory was 1.0 GB in the beginning and 634.9 MB in the end (delta: 380.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-28 18:15:00,240 INFO L168 Benchmark]: Witness Printer took 137.18 ms. Allocated memory is still 2.0 GB. Free memory was 634.9 MB in the beginning and 614.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:00,243 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.33 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 771.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -114.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 839.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19857.46 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 849.9 MB). Free memory was 1.0 GB in the beginning and 634.9 MB in the end (delta: 380.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 137.18 ms. Allocated memory is still 2.0 GB. Free memory was 634.9 MB in the beginning and 614.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1077, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1078, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1079, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1080, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 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 [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1986 SDtfs, 2538 SDslu, 3466 SDs, 0 SdLazy, 1639 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred 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: 4.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 10520 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 92486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...