./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6c0c6e9153dea18fd0e220e58ec075ace4a772 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12:17,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:17,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:17,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:17,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:17,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:17,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:17,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:17,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:17,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:17,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:17,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:17,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:17,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:17,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:17,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:17,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:17,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:17,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:17,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:17,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:17,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:17,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:17,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:17,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:17,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:17,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:17,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:17,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:17,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:17,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:17,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:17,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:17,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:17,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:17,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:17,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:17,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:17,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:17,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:17,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:17,351 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:12:17,386 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:17,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:17,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:17,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:17,389 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:17,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:17,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:17,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:17,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:17,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:17,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:17,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:17,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:17,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:17,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:17,395 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:17,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:17,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:17,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:17,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:17,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:17,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:17,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:17,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:17,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:17,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:17,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:17,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:17,400 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:17,400 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 -> 0d6c0c6e9153dea18fd0e220e58ec075ace4a772 [2019-11-28 18:12:17,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:17,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:17,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:17,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:17,705 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:17,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i [2019-11-28 18:12:17,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312fa71cd/a9675fcca60d416ca6eeeb164f286162/FLAG2a15efff0 [2019-11-28 18:12:18,330 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:18,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_tso.opt.i [2019-11-28 18:12:18,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312fa71cd/a9675fcca60d416ca6eeeb164f286162/FLAG2a15efff0 [2019-11-28 18:12:18,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312fa71cd/a9675fcca60d416ca6eeeb164f286162 [2019-11-28 18:12:18,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:18,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:18,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:18,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:18,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:18,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:18" (1/1) ... [2019-11-28 18:12:18,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:18, skipping insertion in model container [2019-11-28 18:12:18,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:18" (1/1) ... [2019-11-28 18:12:18,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:18,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:19,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:19,155 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:19,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:19,336 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:19,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19 WrapperNode [2019-11-28 18:12:19,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:19,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:19,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:19,338 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:19,346 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:12:19" (1/1) ... [2019-11-28 18:12:19,372 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:12:19" (1/1) ... [2019-11-28 18:12:19,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:19,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:19,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:19,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:19,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (1/1) ... [2019-11-28 18:12:19,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:19,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:19,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:19,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:19,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (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:12:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:19,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:19,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:12:19,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:12:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:19,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:19,510 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:12:20,166 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:20,167 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:20,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:20 BoogieIcfgContainer [2019-11-28 18:12:20,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:20,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:20,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:20,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:20,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:18" (1/3) ... [2019-11-28 18:12:20,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f104cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:20, skipping insertion in model container [2019-11-28 18:12:20,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:19" (2/3) ... [2019-11-28 18:12:20,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f104cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:20, skipping insertion in model container [2019-11-28 18:12:20,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:20" (3/3) ... [2019-11-28 18:12:20,180 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.opt.i [2019-11-28 18:12:20,191 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:20,191 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:20,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:20,204 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:20,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,266 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,303 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,303 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:20,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:12:20,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:20,359 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:20,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:20,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:20,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:20,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:20,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:20,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:20,381 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-11-28 18:12:20,383 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:20,474 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:20,475 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:20,489 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:20,512 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:20,567 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:20,568 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:20,576 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:20,595 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:12:20,597 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:25,159 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-28 18:12:25,290 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 18:12:25,381 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-11-28 18:12:25,381 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:12:25,384 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-11-28 18:12:26,322 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-11-28 18:12:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-11-28 18:12:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:26,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:26,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:26,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-11-28 18:12:26,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:26,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848075653] [2019-11-28 18:12:26,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:26,683 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:12:26,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848075653] [2019-11-28 18:12:26,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:26,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:26,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120836319] [2019-11-28 18:12:26,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:26,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:26,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:26,712 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-11-28 18:12:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:27,020 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-11-28 18:12:27,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:27,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:27,143 INFO L225 Difference]: With dead ends: 11574 [2019-11-28 18:12:27,143 INFO L226 Difference]: Without dead ends: 10902 [2019-11-28 18:12:27,145 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:12:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-11-28 18:12:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-11-28 18:12:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-11-28 18:12:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-11-28 18:12:27,978 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-11-28 18:12:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:27,979 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-11-28 18:12:27,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-11-28 18:12:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:27,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:27,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:27,986 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-11-28 18:12:27,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:27,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144247571] [2019-11-28 18:12:27,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:28,099 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:12:28,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144247571] [2019-11-28 18:12:28,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:28,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:28,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823692689] [2019-11-28 18:12:28,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:28,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:28,102 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 4 states. [2019-11-28 18:12:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:28,447 INFO L93 Difference]: Finished difference Result 16442 states and 60890 transitions. [2019-11-28 18:12:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:28,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:12:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:28,558 INFO L225 Difference]: With dead ends: 16442 [2019-11-28 18:12:28,558 INFO L226 Difference]: Without dead ends: 16416 [2019-11-28 18:12:28,559 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:12:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2019-11-28 18:12:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 14534. [2019-11-28 18:12:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14534 states. [2019-11-28 18:12:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 54626 transitions. [2019-11-28 18:12:29,220 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 54626 transitions. Word has length 13 [2019-11-28 18:12:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:29,220 INFO L462 AbstractCegarLoop]: Abstraction has 14534 states and 54626 transitions. [2019-11-28 18:12:29,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 54626 transitions. [2019-11-28 18:12:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:29,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:29,231 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:12:29,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-11-28 18:12:29,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:29,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539643511] [2019-11-28 18:12:29,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:29,314 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:12:29,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539643511] [2019-11-28 18:12:29,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:29,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:29,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342365699] [2019-11-28 18:12:29,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:29,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:29,316 INFO L87 Difference]: Start difference. First operand 14534 states and 54626 transitions. Second operand 3 states. [2019-11-28 18:12:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:29,483 INFO L93 Difference]: Finished difference Result 19566 states and 73114 transitions. [2019-11-28 18:12:29,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:29,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:29,560 INFO L225 Difference]: With dead ends: 19566 [2019-11-28 18:12:29,561 INFO L226 Difference]: Without dead ends: 19566 [2019-11-28 18:12:29,561 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:12:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19566 states. [2019-11-28 18:12:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19566 to 17774. [2019-11-28 18:12:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17774 states. [2019-11-28 18:12:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17774 states to 17774 states and 66874 transitions. [2019-11-28 18:12:30,392 INFO L78 Accepts]: Start accepts. Automaton has 17774 states and 66874 transitions. Word has length 16 [2019-11-28 18:12:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:30,393 INFO L462 AbstractCegarLoop]: Abstraction has 17774 states and 66874 transitions. [2019-11-28 18:12:30,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17774 states and 66874 transitions. [2019-11-28 18:12:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:30,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:30,408 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:12:30,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-11-28 18:12:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:30,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165957068] [2019-11-28 18:12:30,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:30,511 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:12:30,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165957068] [2019-11-28 18:12:30,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:30,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:30,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625363200] [2019-11-28 18:12:30,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:30,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:30,514 INFO L87 Difference]: Start difference. First operand 17774 states and 66874 transitions. Second operand 5 states. [2019-11-28 18:12:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:30,835 INFO L93 Difference]: Finished difference Result 25142 states and 92536 transitions. [2019-11-28 18:12:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:30,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:12:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:30,930 INFO L225 Difference]: With dead ends: 25142 [2019-11-28 18:12:30,930 INFO L226 Difference]: Without dead ends: 25100 [2019-11-28 18:12:30,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25100 states. [2019-11-28 18:12:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25100 to 19982. [2019-11-28 18:12:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19982 states. [2019-11-28 18:12:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19982 states to 19982 states and 74788 transitions. [2019-11-28 18:12:31,594 INFO L78 Accepts]: Start accepts. Automaton has 19982 states and 74788 transitions. Word has length 16 [2019-11-28 18:12:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:31,595 INFO L462 AbstractCegarLoop]: Abstraction has 19982 states and 74788 transitions. [2019-11-28 18:12:31,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 19982 states and 74788 transitions. [2019-11-28 18:12:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:31,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:31,602 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:12:31,603 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1098036901, now seen corresponding path program 1 times [2019-11-28 18:12:31,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:31,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834354880] [2019-11-28 18:12:31,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:31,695 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:12:31,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834354880] [2019-11-28 18:12:31,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:31,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:31,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700050478] [2019-11-28 18:12:31,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:31,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:31,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:31,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:31,699 INFO L87 Difference]: Start difference. First operand 19982 states and 74788 transitions. Second operand 3 states. [2019-11-28 18:12:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:32,234 INFO L93 Difference]: Finished difference Result 19957 states and 74689 transitions. [2019-11-28 18:12:32,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:32,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:32,291 INFO L225 Difference]: With dead ends: 19957 [2019-11-28 18:12:32,291 INFO L226 Difference]: Without dead ends: 19957 [2019-11-28 18:12:32,292 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:12:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19957 states. [2019-11-28 18:12:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19957 to 19957. [2019-11-28 18:12:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19957 states. [2019-11-28 18:12:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19957 states to 19957 states and 74689 transitions. [2019-11-28 18:12:32,938 INFO L78 Accepts]: Start accepts. Automaton has 19957 states and 74689 transitions. Word has length 18 [2019-11-28 18:12:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:32,941 INFO L462 AbstractCegarLoop]: Abstraction has 19957 states and 74689 transitions. [2019-11-28 18:12:32,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19957 states and 74689 transitions. [2019-11-28 18:12:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:12:32,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:32,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:32,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1441336555, now seen corresponding path program 1 times [2019-11-28 18:12:32,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:32,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030132327] [2019-11-28 18:12:32,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:33,023 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:12:33,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030132327] [2019-11-28 18:12:33,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:33,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:33,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925392009] [2019-11-28 18:12:33,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:33,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:33,025 INFO L87 Difference]: Start difference. First operand 19957 states and 74689 transitions. Second operand 4 states. [2019-11-28 18:12:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:33,054 INFO L93 Difference]: Finished difference Result 2353 states and 6293 transitions. [2019-11-28 18:12:33,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:33,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 18:12:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:33,059 INFO L225 Difference]: With dead ends: 2353 [2019-11-28 18:12:33,059 INFO L226 Difference]: Without dead ends: 2353 [2019-11-28 18:12:33,060 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:12:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-11-28 18:12:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2353. [2019-11-28 18:12:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-11-28 18:12:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 6293 transitions. [2019-11-28 18:12:33,096 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 6293 transitions. Word has length 19 [2019-11-28 18:12:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:33,096 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 6293 transitions. [2019-11-28 18:12:33,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 6293 transitions. [2019-11-28 18:12:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:33,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:33,101 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] [2019-11-28 18:12:33,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-11-28 18:12:33,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:33,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154379492] [2019-11-28 18:12:33,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:33,235 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:12:33,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154379492] [2019-11-28 18:12:33,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:33,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:33,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271993389] [2019-11-28 18:12:33,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:12:33,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:12:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:33,237 INFO L87 Difference]: Start difference. First operand 2353 states and 6293 transitions. Second operand 6 states. [2019-11-28 18:12:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:33,560 INFO L93 Difference]: Finished difference Result 3264 states and 8335 transitions. [2019-11-28 18:12:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:12:33,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 18:12:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:33,564 INFO L225 Difference]: With dead ends: 3264 [2019-11-28 18:12:33,564 INFO L226 Difference]: Without dead ends: 3260 [2019-11-28 18:12:33,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:12:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2019-11-28 18:12:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2386. [2019-11-28 18:12:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2019-11-28 18:12:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 6282 transitions. [2019-11-28 18:12:33,609 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 6282 transitions. Word has length 29 [2019-11-28 18:12:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:33,610 INFO L462 AbstractCegarLoop]: Abstraction has 2386 states and 6282 transitions. [2019-11-28 18:12:33,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:12:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 6282 transitions. [2019-11-28 18:12:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:33,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:33,615 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] [2019-11-28 18:12:33,616 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash -906757855, now seen corresponding path program 1 times [2019-11-28 18:12:33,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:33,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926243437] [2019-11-28 18:12:33,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:33,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926243437] [2019-11-28 18:12:33,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:33,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:33,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351360547] [2019-11-28 18:12:33,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:33,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:33,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:33,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:33,697 INFO L87 Difference]: Start difference. First operand 2386 states and 6282 transitions. Second operand 5 states. [2019-11-28 18:12:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,037 INFO L93 Difference]: Finished difference Result 3538 states and 9205 transitions. [2019-11-28 18:12:34,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:34,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,042 INFO L225 Difference]: With dead ends: 3538 [2019-11-28 18:12:34,042 INFO L226 Difference]: Without dead ends: 3538 [2019-11-28 18:12:34,042 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:12:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2019-11-28 18:12:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3085. [2019-11-28 18:12:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3085 states. [2019-11-28 18:12:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 8122 transitions. [2019-11-28 18:12:34,092 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 8122 transitions. Word has length 29 [2019-11-28 18:12:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,093 INFO L462 AbstractCegarLoop]: Abstraction has 3085 states and 8122 transitions. [2019-11-28 18:12:34,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 8122 transitions. [2019-11-28 18:12:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:12:34,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,101 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] [2019-11-28 18:12:34,101 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2140105962, now seen corresponding path program 1 times [2019-11-28 18:12:34,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033562737] [2019-11-28 18:12:34,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,158 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:12:34,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033562737] [2019-11-28 18:12:34,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:34,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906108780] [2019-11-28 18:12:34,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:34,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:34,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:34,160 INFO L87 Difference]: Start difference. First operand 3085 states and 8122 transitions. Second operand 3 states. [2019-11-28 18:12:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,190 INFO L93 Difference]: Finished difference Result 3018 states and 7894 transitions. [2019-11-28 18:12:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:34,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 18:12:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,197 INFO L225 Difference]: With dead ends: 3018 [2019-11-28 18:12:34,197 INFO L226 Difference]: Without dead ends: 3018 [2019-11-28 18:12:34,198 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:12:34,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-11-28 18:12:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2653. [2019-11-28 18:12:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-11-28 18:12:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6957 transitions. [2019-11-28 18:12:34,241 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6957 transitions. Word has length 30 [2019-11-28 18:12:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,241 INFO L462 AbstractCegarLoop]: Abstraction has 2653 states and 6957 transitions. [2019-11-28 18:12:34,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6957 transitions. [2019-11-28 18:12:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:12:34,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,248 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] [2019-11-28 18:12:34,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:34,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1710409753, now seen corresponding path program 1 times [2019-11-28 18:12:34,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006169699] [2019-11-28 18:12:34,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,308 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:12:34,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006169699] [2019-11-28 18:12:34,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:34,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362163020] [2019-11-28 18:12:34,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:34,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:34,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:34,311 INFO L87 Difference]: Start difference. First operand 2653 states and 6957 transitions. Second operand 5 states. [2019-11-28 18:12:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,343 INFO L93 Difference]: Finished difference Result 1688 states and 4597 transitions. [2019-11-28 18:12:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:34,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:12:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,346 INFO L225 Difference]: With dead ends: 1688 [2019-11-28 18:12:34,346 INFO L226 Difference]: Without dead ends: 1688 [2019-11-28 18:12:34,347 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:12:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2019-11-28 18:12:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1652. [2019-11-28 18:12:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-11-28 18:12:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 4513 transitions. [2019-11-28 18:12:34,371 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 4513 transitions. Word has length 30 [2019-11-28 18:12:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,372 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 4513 transitions. [2019-11-28 18:12:34,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 4513 transitions. [2019-11-28 18:12:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:34,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,377 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] [2019-11-28 18:12:34,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 91748315, now seen corresponding path program 1 times [2019-11-28 18:12:34,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55085018] [2019-11-28 18:12:34,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,945 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-28 18:12:35,056 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:12:35,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55085018] [2019-11-28 18:12:35,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:35,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:12:35,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669039113] [2019-11-28 18:12:35,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:12:35,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:35,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:12:35,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:12:35,059 INFO L87 Difference]: Start difference. First operand 1652 states and 4513 transitions. Second operand 9 states. [2019-11-28 18:12:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,136 INFO L93 Difference]: Finished difference Result 3858 states and 9380 transitions. [2019-11-28 18:12:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:12:36,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-11-28 18:12:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,142 INFO L225 Difference]: With dead ends: 3858 [2019-11-28 18:12:36,142 INFO L226 Difference]: Without dead ends: 3127 [2019-11-28 18:12:36,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-11-28 18:12:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2019-11-28 18:12:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2024. [2019-11-28 18:12:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-28 18:12:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 5275 transitions. [2019-11-28 18:12:36,183 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 5275 transitions. Word has length 45 [2019-11-28 18:12:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,183 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 5275 transitions. [2019-11-28 18:12:36,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:12:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 5275 transitions. [2019-11-28 18:12:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:36,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,188 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] [2019-11-28 18:12:36,189 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1896706635, now seen corresponding path program 2 times [2019-11-28 18:12:36,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603248244] [2019-11-28 18:12:36,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,356 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:12:36,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603248244] [2019-11-28 18:12:36,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:36,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872529049] [2019-11-28 18:12:36,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:36,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:36,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:36,359 INFO L87 Difference]: Start difference. First operand 2024 states and 5275 transitions. Second operand 5 states. [2019-11-28 18:12:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,408 INFO L93 Difference]: Finished difference Result 2793 states and 6993 transitions. [2019-11-28 18:12:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:36,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 18:12:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,413 INFO L225 Difference]: With dead ends: 2793 [2019-11-28 18:12:36,413 INFO L226 Difference]: Without dead ends: 1952 [2019-11-28 18:12:36,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:12:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2019-11-28 18:12:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1444. [2019-11-28 18:12:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-11-28 18:12:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3860 transitions. [2019-11-28 18:12:36,439 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3860 transitions. Word has length 45 [2019-11-28 18:12:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,439 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3860 transitions. [2019-11-28 18:12:36,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3860 transitions. [2019-11-28 18:12:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:36,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,444 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] [2019-11-28 18:12:36,444 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1010142777, now seen corresponding path program 3 times [2019-11-28 18:12:36,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023286673] [2019-11-28 18:12:36,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,546 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:12:36,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023286673] [2019-11-28 18:12:36,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:36,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317530680] [2019-11-28 18:12:36,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:36,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:36,548 INFO L87 Difference]: Start difference. First operand 1444 states and 3860 transitions. Second operand 3 states. [2019-11-28 18:12:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,562 INFO L93 Difference]: Finished difference Result 2018 states and 5180 transitions. [2019-11-28 18:12:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:36,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:12:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,564 INFO L225 Difference]: With dead ends: 2018 [2019-11-28 18:12:36,564 INFO L226 Difference]: Without dead ends: 624 [2019-11-28 18:12:36,564 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:12:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-28 18:12:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-11-28 18:12:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-11-28 18:12:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1409 transitions. [2019-11-28 18:12:36,578 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1409 transitions. Word has length 45 [2019-11-28 18:12:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,579 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 1409 transitions. [2019-11-28 18:12:36,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1409 transitions. [2019-11-28 18:12:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:36,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,581 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] [2019-11-28 18:12:36,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 4 times [2019-11-28 18:12:36,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954156864] [2019-11-28 18:12:36,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:36,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:36,734 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:36,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26|) 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t894~0.base_26|) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t894~0.base_26| 4)) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26|) |v_ULTIMATE.start_main_~#t894~0.offset_19| 0)) |v_#memory_int_21|) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26| 1)) (= |v_ULTIMATE.start_main_~#t894~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_16|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_~#t894~0.base=|v_ULTIMATE.start_main_~#t894~0.base_26|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~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_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t894~0.offset=|v_ULTIMATE.start_main_~#t894~0.offset_19|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t895~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t896~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t894~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t895~0.base, 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, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t894~0.offset, ULTIMATE.start_main_~#t896~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:36,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t895~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_ULTIMATE.start_main_~#t895~0.offset_10| 0) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t895~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11|) |v_ULTIMATE.start_main_~#t895~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t895~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t895~0.offset] because there is no mapped edge [2019-11-28 18:12:36,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t896~0.base_13|) (= |v_ULTIMATE.start_main_~#t896~0.offset_11| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t896~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t896~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13|) |v_ULTIMATE.start_main_~#t896~0.offset_11| 2))) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t896~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t896~0.base] because there is no mapped edge [2019-11-28 18:12:36,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:36,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:36,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1696772855 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1696772855| |P1Thread1of1ForFork1_#t~ite14_Out-1696772855|) (= ~z$w_buff0_used~0_In-1696772855 |P1Thread1of1ForFork1_#t~ite15_Out-1696772855|) (not .cse0)) (and (= ~z$w_buff0_used~0_In-1696772855 |P1Thread1of1ForFork1_#t~ite14_Out-1696772855|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1696772855| |P1Thread1of1ForFork1_#t~ite14_Out-1696772855|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1696772855 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1696772855 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-1696772855 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1696772855 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696772855, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1696772855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696772855, ~weak$$choice2~0=~weak$$choice2~0_In-1696772855, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1696772855, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1696772855|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696772855, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1696772855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696772855, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1696772855|, ~weak$$choice2~0=~weak$$choice2~0_In-1696772855, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1696772855|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1696772855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:36,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:36,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:36,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-663050372 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-663050372 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|)) (and (= ~z$w_buff0_used~0_In-663050372 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-663050372, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-663050372} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-663050372, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-663050372, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-663050372|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:36,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1749550018 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1749550018 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1749550018 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1749550018 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1749550018|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1749550018 |P2Thread1of1ForFork2_#t~ite29_Out1749550018|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1749550018, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1749550018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749550018, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1749550018} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1749550018, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1749550018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749550018, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1749550018, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1749550018|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:36,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In508590166 ~z$r_buff0_thd3~0_Out508590166)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In508590166 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In508590166 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd3~0_Out508590166)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In508590166, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508590166} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out508590166|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In508590166, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out508590166} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:36,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1700303365 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1700303365 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1700303365 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1700303365 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1700303365 |P2Thread1of1ForFork2_#t~ite31_Out-1700303365|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1700303365|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1700303365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1700303365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1700303365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1700303365} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1700303365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1700303365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1700303365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1700303365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1700303365} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:36,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:36,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:36,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2071145013 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2071145013 256) 0))) (or (and (= ~z~0_In-2071145013 |ULTIMATE.start_main_#t~ite35_Out-2071145013|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-2071145013 |ULTIMATE.start_main_#t~ite35_Out-2071145013|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2071145013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2071145013, ~z$w_buff1~0=~z$w_buff1~0_In-2071145013, ~z~0=~z~0_In-2071145013} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2071145013, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2071145013|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2071145013, ~z$w_buff1~0=~z$w_buff1~0_In-2071145013, ~z~0=~z~0_In-2071145013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:36,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:36,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1088995816 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1088995816 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1088995816| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1088995816| ~z$w_buff0_used~0_In-1088995816)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1088995816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1088995816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1088995816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1088995816, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1088995816|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:36,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1570503531 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1570503531 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1570503531 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1570503531 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1570503531 |ULTIMATE.start_main_#t~ite38_Out1570503531|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out1570503531|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1570503531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1570503531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1570503531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1570503531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1570503531|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:36,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-526458441 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-526458441 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-526458441|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-526458441 |ULTIMATE.start_main_#t~ite39_Out-526458441|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-526458441, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-526458441} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-526458441, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-526458441|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-526458441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:36,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1139098528 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1139098528 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1139098528 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1139098528 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1139098528|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1139098528| ~z$r_buff1_thd0~0_In1139098528) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139098528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139098528, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139098528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139098528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139098528, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1139098528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139098528, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139098528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139098528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:36,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~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:12:36,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:36 BasicIcfg [2019-11-28 18:12:36,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:36,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:36,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:36,884 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:36,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:20" (3/4) ... [2019-11-28 18:12:36,887 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:36,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26|) 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t894~0.base_26|) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t894~0.base_26| 4)) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t894~0.base_26|) |v_ULTIMATE.start_main_~#t894~0.offset_19| 0)) |v_#memory_int_21|) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t894~0.base_26| 1)) (= |v_ULTIMATE.start_main_~#t894~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_16|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_16|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_~#t894~0.base=|v_ULTIMATE.start_main_~#t894~0.base_26|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~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_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t894~0.offset=|v_ULTIMATE.start_main_~#t894~0.offset_19|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_19|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, #NULL.base=|v_#NULL.base_7|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t895~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t896~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t894~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t895~0.base, 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, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t894~0.offset, ULTIMATE.start_main_~#t896~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:36,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t895~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_ULTIMATE.start_main_~#t895~0.offset_10| 0) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t895~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t895~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t895~0.base_11|) |v_ULTIMATE.start_main_~#t895~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t895~0.base=|v_ULTIMATE.start_main_~#t895~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t895~0.offset=|v_ULTIMATE.start_main_~#t895~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t895~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t895~0.offset] because there is no mapped edge [2019-11-28 18:12:36,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t896~0.base_13|) (= |v_ULTIMATE.start_main_~#t896~0.offset_11| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t896~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t896~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t896~0.base_13|) |v_ULTIMATE.start_main_~#t896~0.offset_11| 2))) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t896~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t896~0.offset=|v_ULTIMATE.start_main_~#t896~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t896~0.base=|v_ULTIMATE.start_main_~#t896~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t896~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t896~0.base] because there is no mapped edge [2019-11-28 18:12:36,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:36,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:36,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1696772855 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1696772855| |P1Thread1of1ForFork1_#t~ite14_Out-1696772855|) (= ~z$w_buff0_used~0_In-1696772855 |P1Thread1of1ForFork1_#t~ite15_Out-1696772855|) (not .cse0)) (and (= ~z$w_buff0_used~0_In-1696772855 |P1Thread1of1ForFork1_#t~ite14_Out-1696772855|) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1696772855| |P1Thread1of1ForFork1_#t~ite14_Out-1696772855|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1696772855 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1696772855 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-1696772855 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1696772855 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696772855, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1696772855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696772855, ~weak$$choice2~0=~weak$$choice2~0_In-1696772855, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1696772855, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1696772855|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696772855, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1696772855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696772855, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1696772855|, ~weak$$choice2~0=~weak$$choice2~0_In-1696772855, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1696772855|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1696772855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:36,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:36,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:36,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-663050372 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-663050372 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|)) (and (= ~z$w_buff0_used~0_In-663050372 |P2Thread1of1ForFork2_#t~ite28_Out-663050372|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-663050372, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-663050372} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-663050372, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-663050372, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-663050372|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:36,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1749550018 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1749550018 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1749550018 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1749550018 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1749550018|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1749550018 |P2Thread1of1ForFork2_#t~ite29_Out1749550018|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1749550018, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1749550018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749550018, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1749550018} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1749550018, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1749550018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1749550018, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1749550018, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1749550018|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:36,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In508590166 ~z$r_buff0_thd3~0_Out508590166)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In508590166 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In508590166 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd3~0_Out508590166)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In508590166, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In508590166} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out508590166|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In508590166, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out508590166} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:36,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1700303365 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1700303365 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1700303365 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1700303365 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1700303365 |P2Thread1of1ForFork2_#t~ite31_Out-1700303365|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1700303365|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1700303365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1700303365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1700303365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1700303365} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1700303365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1700303365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1700303365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1700303365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1700303365} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:36,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:36,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:36,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2071145013 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2071145013 256) 0))) (or (and (= ~z~0_In-2071145013 |ULTIMATE.start_main_#t~ite35_Out-2071145013|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-2071145013 |ULTIMATE.start_main_#t~ite35_Out-2071145013|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2071145013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2071145013, ~z$w_buff1~0=~z$w_buff1~0_In-2071145013, ~z~0=~z~0_In-2071145013} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2071145013, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2071145013|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2071145013, ~z$w_buff1~0=~z$w_buff1~0_In-2071145013, ~z~0=~z~0_In-2071145013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:36,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:36,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1088995816 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1088995816 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1088995816| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1088995816| ~z$w_buff0_used~0_In-1088995816)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1088995816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1088995816} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1088995816, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1088995816, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1088995816|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:36,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1570503531 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1570503531 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1570503531 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1570503531 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1570503531 |ULTIMATE.start_main_#t~ite38_Out1570503531|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out1570503531|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1570503531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1570503531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1570503531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1570503531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1570503531|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:36,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-526458441 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-526458441 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-526458441|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-526458441 |ULTIMATE.start_main_#t~ite39_Out-526458441|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-526458441, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-526458441} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-526458441, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-526458441|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-526458441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:36,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1139098528 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1139098528 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1139098528 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1139098528 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1139098528|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite40_Out1139098528| ~z$r_buff1_thd0~0_In1139098528) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139098528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139098528, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139098528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139098528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139098528, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1139098528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139098528, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139098528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139098528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:36,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~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:12:37,059 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:37,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:37,062 INFO L168 Benchmark]: Toolchain (without parser) took 18462.52 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -455.2 MB). Peak memory consumption was 655.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:37,062 INFO L168 Benchmark]: CDTParser took 0.74 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:12:37,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:37,069 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:37,070 INFO L168 Benchmark]: Boogie Preprocessor took 37.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:37,071 INFO L168 Benchmark]: RCFGBuilder took 728.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:37,071 INFO L168 Benchmark]: TraceAbstraction took 16713.64 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 965.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -381.8 MB). Peak memory consumption was 584.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:37,072 INFO L168 Benchmark]: Witness Printer took 176.48 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:37,075 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.74 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 733.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 728.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16713.64 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 965.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -381.8 MB). Peak memory consumption was 584.0 MB. Max. memory is 11.5 GB. * Witness Printer took 176.48 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t894, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L832] FCALL, FORK 0 pthread_create(&t895, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] FCALL, FORK 0 pthread_create(&t896, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1510 SDtfs, 1729 SDslu, 2580 SDs, 0 SdLazy, 1490 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19982occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 12131 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 63817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...