/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:54:57,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:54:57,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:54:57,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:54:57,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:54:57,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:54:57,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:54:57,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:54:57,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:54:57,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:54:57,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:54:57,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:54:57,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:54:57,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:54:57,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:54:57,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:54:57,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:54:57,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:54:57,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:54:57,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:54:57,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:54:57,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:54:57,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:54:57,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:54:57,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:54:57,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:54:57,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:54:57,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:54:57,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:54:57,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:54:57,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:54:57,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:54:57,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:54:57,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:54:57,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:54:57,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:54:57,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:54:57,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:54:57,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:54:57,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:54:57,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:54:57,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:54:57,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:54:57,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:54:57,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:54:57,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:54:57,397 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:54:57,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:54:57,398 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:54:57,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:54:57,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:54:57,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:54:57,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:54:57,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:54:57,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:54:57,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:54:57,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:54:57,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:54:57,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:54:57,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:54:57,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:54:57,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:54:57,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:54:57,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:54:57,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:54:57,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:54:57,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:54:57,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:54:57,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:54:57,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:54:57,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:54:57,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:54:57,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:54:57,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:54:57,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:54:57,706 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:54:57,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-18 17:54:57,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154a4f7ff/2537ccdd39c04b1ca8b5ee533cc2c4b6/FLAG8e87ecbf5 [2019-12-18 17:54:58,295 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:54:58,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-18 17:54:58,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154a4f7ff/2537ccdd39c04b1ca8b5ee533cc2c4b6/FLAG8e87ecbf5 [2019-12-18 17:54:58,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154a4f7ff/2537ccdd39c04b1ca8b5ee533cc2c4b6 [2019-12-18 17:54:58,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:54:58,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:54:58,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:54:58,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:54:58,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:54:58,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:54:58" (1/1) ... [2019-12-18 17:54:58,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c07bab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:58, skipping insertion in model container [2019-12-18 17:54:58,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:54:58" (1/1) ... [2019-12-18 17:54:58,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:54:58,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:54:59,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:54:59,218 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:54:59,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:54:59,364 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:54:59,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59 WrapperNode [2019-12-18 17:54:59,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:54:59,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:54:59,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:54:59,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:54:59,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:54:59,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:54:59,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:54:59,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:54:59,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... [2019-12-18 17:54:59,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:54:59,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:54:59,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:54:59,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:54:59,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:54:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:54:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:54:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:54:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:54:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:54:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:54:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:54:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:54:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:54:59,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:54:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:54:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:54:59,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:54:59,558 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:55:00,307 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:55:00,307 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:55:00,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:55:00 BoogieIcfgContainer [2019-12-18 17:55:00,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:55:00,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:55:00,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:55:00,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:55:00,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:54:58" (1/3) ... [2019-12-18 17:55:00,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a37b594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:55:00, skipping insertion in model container [2019-12-18 17:55:00,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:59" (2/3) ... [2019-12-18 17:55:00,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a37b594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:55:00, skipping insertion in model container [2019-12-18 17:55:00,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:55:00" (3/3) ... [2019-12-18 17:55:00,317 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2019-12-18 17:55:00,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:55:00,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:55:00,336 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:55:00,337 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:55:00,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,395 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,395 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,396 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,410 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,417 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:55:00,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:55:00,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:55:00,475 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:55:00,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:55:00,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:55:00,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:55:00,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:55:00,480 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:55:00,480 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:55:00,498 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 17:55:00,500 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 17:55:00,577 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 17:55:00,578 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:55:00,591 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:55:00,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 17:55:00,652 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 17:55:00,653 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:55:00,659 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:55:00,674 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:55:00,675 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:55:05,274 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 17:55:05,391 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:55:05,413 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-18 17:55:05,413 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 17:55:05,416 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 17:55:06,586 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-18 17:55:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-18 17:55:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:55:06,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:06,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:06,596 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-12-18 17:55:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-18 17:55:06,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:06,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412927870] [2019-12-18 17:55:06,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:06,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412927870] [2019-12-18 17:55:06,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:06,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:55:06,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879855078] [2019-12-18 17:55:06,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:06,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:07,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:07,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:07,011 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-18 17:55:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:07,336 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-18 17:55:07,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:07,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:55:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:07,504 INFO L225 Difference]: With dead ends: 16398 [2019-12-18 17:55:07,504 INFO L226 Difference]: Without dead ends: 16062 [2019-12-18 17:55:07,505 INFO L631 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-12-18 17:55:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-18 17:55:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-18 17:55:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-18 17:55:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-18 17:55:08,897 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-18 17:55:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:08,899 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-18 17:55:08,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-18 17:55:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:55:08,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:08,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:08,911 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-12-18 17:55:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-18 17:55:08,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:08,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180991836] [2019-12-18 17:55:08,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:09,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180991836] [2019-12-18 17:55:09,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:09,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:09,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475694147] [2019-12-18 17:55:09,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:55:09,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:55:09,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:09,065 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-18 17:55:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:09,653 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-18 17:55:09,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:09,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:55:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:09,758 INFO L225 Difference]: With dead ends: 24942 [2019-12-18 17:55:09,758 INFO L226 Difference]: Without dead ends: 24928 [2019-12-18 17:55:09,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-18 17:55:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-18 17:55:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-18 17:55:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-18 17:55:10,662 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-18 17:55:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:10,663 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-18 17:55:10,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:55:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-18 17:55:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:55:10,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:10,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:10,665 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-12-18 17:55:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-18 17:55:10,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:10,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177228497] [2019-12-18 17:55:10,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:10,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177228497] [2019-12-18 17:55:10,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:10,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:10,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467606244] [2019-12-18 17:55:10,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:10,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:10,714 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-18 17:55:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:10,780 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-18 17:55:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:10,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:55:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:10,813 INFO L225 Difference]: With dead ends: 12675 [2019-12-18 17:55:10,814 INFO L226 Difference]: Without dead ends: 12675 [2019-12-18 17:55:10,814 INFO L631 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-12-18 17:55:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-18 17:55:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-18 17:55:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-18 17:55:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-18 17:55:11,147 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-18 17:55:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:11,148 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-18 17:55:11,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-18 17:55:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:55:11,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:11,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:11,150 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-12-18 17:55:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-18 17:55:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:11,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587706494] [2019-12-18 17:55:11,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:12,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587706494] [2019-12-18 17:55:12,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:12,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:12,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71375071] [2019-12-18 17:55:12,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:55:12,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:55:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:55:12,219 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-18 17:55:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:12,241 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-18 17:55:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:55:12,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:55:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:12,247 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 17:55:12,248 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 17:55:12,248 INFO L631 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-12-18 17:55:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 17:55:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-18 17:55:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-18 17:55:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-18 17:55:12,281 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-18 17:55:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:12,281 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-18 17:55:12,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:55:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-18 17:55:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:55:12,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:12,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:12,284 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-12-18 17:55:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-18 17:55:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196606246] [2019-12-18 17:55:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:12,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196606246] [2019-12-18 17:55:12,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:12,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:55:12,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652661123] [2019-12-18 17:55:12,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:12,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:12,378 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-18 17:55:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:12,404 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 17:55:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:12,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:55:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:12,406 INFO L225 Difference]: With dead ends: 653 [2019-12-18 17:55:12,406 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 17:55:12,406 INFO L631 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-12-18 17:55:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 17:55:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 17:55:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 17:55:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 17:55:12,427 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 17:55:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:12,428 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 17:55:12,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 17:55:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:55:12,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:12,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:12,438 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-12-18 17:55:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-18 17:55:12,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:12,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038746549] [2019-12-18 17:55:12,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:12,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038746549] [2019-12-18 17:55:12,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:12,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:12,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095567121] [2019-12-18 17:55:12,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:12,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:12,616 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 17:55:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:12,681 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-18 17:55:12,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:12,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:55:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:12,685 INFO L225 Difference]: With dead ends: 607 [2019-12-18 17:55:12,685 INFO L226 Difference]: Without dead ends: 607 [2019-12-18 17:55:12,686 INFO L631 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-12-18 17:55:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-18 17:55:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-18 17:55:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-18 17:55:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-18 17:55:12,702 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-18 17:55:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:12,702 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-18 17:55:12,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-18 17:55:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:55:12,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:12,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:12,706 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-12-18 17:55:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-18 17:55:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:12,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384401719] [2019-12-18 17:55:12,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:12,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384401719] [2019-12-18 17:55:12,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:12,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:12,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458691442] [2019-12-18 17:55:12,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:12,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:12,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:12,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:12,881 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-18 17:55:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:13,115 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-18 17:55:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:13,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 17:55:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:13,118 INFO L225 Difference]: With dead ends: 892 [2019-12-18 17:55:13,118 INFO L226 Difference]: Without dead ends: 892 [2019-12-18 17:55:13,119 INFO L631 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-12-18 17:55:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-18 17:55:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-18 17:55:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-18 17:55:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-18 17:55:13,132 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-18 17:55:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:13,133 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-18 17:55:13,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-18 17:55:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:55:13,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:13,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:13,135 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-12-18 17:55:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-18 17:55:13,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:13,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613555286] [2019-12-18 17:55:13,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:13,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613555286] [2019-12-18 17:55:13,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:13,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:55:13,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707068373] [2019-12-18 17:55:13,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:13,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:13,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:13,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:13,276 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 6 states. [2019-12-18 17:55:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:13,616 INFO L93 Difference]: Finished difference Result 1189 states and 2773 transitions. [2019-12-18 17:55:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:55:13,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:55:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:13,621 INFO L225 Difference]: With dead ends: 1189 [2019-12-18 17:55:13,621 INFO L226 Difference]: Without dead ends: 1189 [2019-12-18 17:55:13,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-18 17:55:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 759. [2019-12-18 17:55:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-18 17:55:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-18 17:55:13,638 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-18 17:55:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:13,638 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-18 17:55:13,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-18 17:55:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:55:13,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:13,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:13,641 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-12-18 17:55:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-18 17:55:13,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:13,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558273533] [2019-12-18 17:55:13,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:13,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558273533] [2019-12-18 17:55:13,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:13,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:55:13,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865385279] [2019-12-18 17:55:13,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:13,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:13,751 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 6 states. [2019-12-18 17:55:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:14,057 INFO L93 Difference]: Finished difference Result 1185 states and 2766 transitions. [2019-12-18 17:55:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:55:14,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:55:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:14,060 INFO L225 Difference]: With dead ends: 1185 [2019-12-18 17:55:14,060 INFO L226 Difference]: Without dead ends: 1185 [2019-12-18 17:55:14,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:55:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-18 17:55:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 839. [2019-12-18 17:55:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-12-18 17:55:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1986 transitions. [2019-12-18 17:55:14,078 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1986 transitions. Word has length 55 [2019-12-18 17:55:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:14,078 INFO L462 AbstractCegarLoop]: Abstraction has 839 states and 1986 transitions. [2019-12-18 17:55:14,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1986 transitions. [2019-12-18 17:55:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:55:14,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:14,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:14,081 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-12-18 17:55:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash 817618467, now seen corresponding path program 4 times [2019-12-18 17:55:14,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:14,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387473220] [2019-12-18 17:55:14,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:14,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387473220] [2019-12-18 17:55:14,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:14,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:14,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118098326] [2019-12-18 17:55:14,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:14,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:14,147 INFO L87 Difference]: Start difference. First operand 839 states and 1986 transitions. Second operand 3 states. [2019-12-18 17:55:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:14,162 INFO L93 Difference]: Finished difference Result 737 states and 1703 transitions. [2019-12-18 17:55:14,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:14,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:55:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:14,165 INFO L225 Difference]: With dead ends: 737 [2019-12-18 17:55:14,165 INFO L226 Difference]: Without dead ends: 737 [2019-12-18 17:55:14,165 INFO L631 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-12-18 17:55:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-18 17:55:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-12-18 17:55:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-18 17:55:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1703 transitions. [2019-12-18 17:55:14,179 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1703 transitions. Word has length 55 [2019-12-18 17:55:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:14,180 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1703 transitions. [2019-12-18 17:55:14,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1703 transitions. [2019-12-18 17:55:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:55:14,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:14,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:14,183 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-12-18 17:55:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-18 17:55:14,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:14,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248969304] [2019-12-18 17:55:14,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:14,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248969304] [2019-12-18 17:55:14,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:14,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:14,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522550514] [2019-12-18 17:55:14,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:14,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:14,271 INFO L87 Difference]: Start difference. First operand 737 states and 1703 transitions. Second operand 3 states. [2019-12-18 17:55:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:14,320 INFO L93 Difference]: Finished difference Result 736 states and 1701 transitions. [2019-12-18 17:55:14,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:14,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:55:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:14,322 INFO L225 Difference]: With dead ends: 736 [2019-12-18 17:55:14,322 INFO L226 Difference]: Without dead ends: 736 [2019-12-18 17:55:14,322 INFO L631 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-12-18 17:55:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-12-18 17:55:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 473. [2019-12-18 17:55:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-18 17:55:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-18 17:55:14,331 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-18 17:55:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:14,332 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-18 17:55:14,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-18 17:55:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:55:14,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:14,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:14,334 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-12-18 17:55:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-18 17:55:14,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:14,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869751130] [2019-12-18 17:55:14,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:14,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869751130] [2019-12-18 17:55:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:55:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766308985] [2019-12-18 17:55:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:55:14,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:55:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:55:14,470 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 7 states. [2019-12-18 17:55:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:14,583 INFO L93 Difference]: Finished difference Result 879 states and 1872 transitions. [2019-12-18 17:55:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:55:14,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:55:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:14,585 INFO L225 Difference]: With dead ends: 879 [2019-12-18 17:55:14,585 INFO L226 Difference]: Without dead ends: 578 [2019-12-18 17:55:14,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:55:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-18 17:55:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-18 17:55:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-18 17:55:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-18 17:55:14,593 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-18 17:55:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:14,593 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-18 17:55:14,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:55:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-18 17:55:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:55:14,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:14,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:14,595 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-12-18 17:55:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-18 17:55:14,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:14,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889331947] [2019-12-18 17:55:14,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:14,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889331947] [2019-12-18 17:55:14,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:14,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:14,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632971269] [2019-12-18 17:55:14,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:14,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:14,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:14,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:14,721 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-18 17:55:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:14,809 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-18 17:55:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:14,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 17:55:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:14,811 INFO L225 Difference]: With dead ends: 644 [2019-12-18 17:55:14,811 INFO L226 Difference]: Without dead ends: 231 [2019-12-18 17:55:14,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:55:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-18 17:55:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-18 17:55:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-18 17:55:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-18 17:55:14,820 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-18 17:55:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:14,820 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-18 17:55:14,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-18 17:55:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:55:14,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:14,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:14,823 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-12-18 17:55:14,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:14,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-18 17:55:14,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:14,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735548867] [2019-12-18 17:55:14,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:15,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735548867] [2019-12-18 17:55:15,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:15,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:55:15,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803551343] [2019-12-18 17:55:15,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:55:15,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:55:15,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:55:15,083 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 12 states. [2019-12-18 17:55:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:15,496 INFO L93 Difference]: Finished difference Result 371 states and 637 transitions. [2019-12-18 17:55:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:55:15,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 17:55:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:15,497 INFO L225 Difference]: With dead ends: 371 [2019-12-18 17:55:15,498 INFO L226 Difference]: Without dead ends: 341 [2019-12-18 17:55:15,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:55:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-18 17:55:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2019-12-18 17:55:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 17:55:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 17:55:15,504 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-18 17:55:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:15,506 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 17:55:15,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:55:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 17:55:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:55:15,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:15,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:15,508 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 4 times [2019-12-18 17:55:15,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:15,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728743940] [2019-12-18 17:55:15,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:15,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728743940] [2019-12-18 17:55:15,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:15,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 17:55:15,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398457573] [2019-12-18 17:55:15,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 17:55:15,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 17:55:16,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:55:16,000 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 18 states. [2019-12-18 17:55:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:17,454 INFO L93 Difference]: Finished difference Result 775 states and 1331 transitions. [2019-12-18 17:55:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:55:17,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 17:55:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:17,456 INFO L225 Difference]: With dead ends: 775 [2019-12-18 17:55:17,456 INFO L226 Difference]: Without dead ends: 745 [2019-12-18 17:55:17,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 17:55:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-12-18 17:55:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 331. [2019-12-18 17:55:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 17:55:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-18 17:55:17,465 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 57 [2019-12-18 17:55:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:17,466 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-18 17:55:17,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 17:55:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-18 17:55:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:55:17,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:17,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:17,467 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1124170117, now seen corresponding path program 5 times [2019-12-18 17:55:17,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:17,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972979951] [2019-12-18 17:55:17,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:18,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972979951] [2019-12-18 17:55:18,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:18,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 17:55:18,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067863301] [2019-12-18 17:55:18,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 17:55:18,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 17:55:18,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:55:18,191 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 20 states. [2019-12-18 17:55:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:19,930 INFO L93 Difference]: Finished difference Result 761 states and 1317 transitions. [2019-12-18 17:55:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 17:55:19,931 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-18 17:55:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:19,932 INFO L225 Difference]: With dead ends: 761 [2019-12-18 17:55:19,932 INFO L226 Difference]: Without dead ends: 731 [2019-12-18 17:55:19,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=228, Invalid=1254, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 17:55:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-12-18 17:55:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 341. [2019-12-18 17:55:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-18 17:55:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 599 transitions. [2019-12-18 17:55:19,940 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 599 transitions. Word has length 57 [2019-12-18 17:55:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:19,941 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 599 transitions. [2019-12-18 17:55:19,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 17:55:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 599 transitions. [2019-12-18 17:55:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:55:19,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:19,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:19,942 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 6 times [2019-12-18 17:55:19,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:19,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48645745] [2019-12-18 17:55:19,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:55:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:55:20,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:55:20,039 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:55:20,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1492~0.base_26| 4)) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1492~0.base_26|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= 0 |v_ULTIMATE.start_main_~#t1492~0.offset_19|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1492~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1492~0.base_26|) |v_ULTIMATE.start_main_~#t1492~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_26| 1) |v_#valid_60|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= v_~main$tmp_guard0~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_26|)) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_21|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_26|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t1492~0.offset=|v_ULTIMATE.start_main_~#t1492~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_~#t1492~0.base=|v_ULTIMATE.start_main_~#t1492~0.base_26|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1493~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1494~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1494~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1493~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1492~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1492~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:55:20,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1493~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1493~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1493~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13|) |v_ULTIMATE.start_main_~#t1493~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_11|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1493~0.offset, ULTIMATE.start_main_~#t1493~0.base] because there is no mapped edge [2019-12-18 17:55:20,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1494~0.offset_10|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1494~0.base_12|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12|) |v_ULTIMATE.start_main_~#t1494~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1494~0.offset, ULTIMATE.start_main_~#t1494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:55:20,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:55:20,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:55:20,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-423469130 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-423469130 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-423469130|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-423469130 |P2Thread1of1ForFork0_#t~ite11_Out-423469130|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-423469130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-423469130, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-423469130|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-423469130} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 17:55:20,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-951914203 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-951914203 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-951914203 |P1Thread1of1ForFork2_#t~ite3_Out-951914203|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-951914203| ~y$w_buff1~0_In-951914203)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-951914203, ~y$w_buff1~0=~y$w_buff1~0_In-951914203, ~y~0=~y~0_In-951914203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951914203} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-951914203, ~y$w_buff1~0=~y$w_buff1~0_In-951914203, ~y~0=~y~0_In-951914203, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-951914203|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951914203} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:55:20,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:55:20,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In955859779 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In955859779 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out955859779|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out955859779| ~y$w_buff0_used~0_In955859779)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In955859779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In955859779} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In955859779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In955859779, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out955859779|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:55:20,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In529639429 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In529639429 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In529639429 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In529639429 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out529639429| ~y$w_buff1_used~0_In529639429) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out529639429|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In529639429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In529639429, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In529639429, ~y$w_buff1_used~0=~y$w_buff1_used~0_In529639429} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In529639429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In529639429, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In529639429, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out529639429|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In529639429} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:55:20,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In270736742 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In270736742 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out270736742|)) (and (= ~y$r_buff0_thd2~0_In270736742 |P1Thread1of1ForFork2_#t~ite7_Out270736742|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In270736742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In270736742} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In270736742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In270736742, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out270736742|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:55:20,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1172724504 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1172724504 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1172724504 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1172724504 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1172724504 |P2Thread1of1ForFork0_#t~ite12_Out1172724504|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1172724504|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1172724504, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1172724504, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1172724504, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1172724504} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1172724504, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1172724504, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1172724504|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1172724504, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1172724504} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:55:20,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1768467930 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1768467930 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1768467930 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1768467930 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out-1768467930| ~y$r_buff1_thd2~0_In-1768467930)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1768467930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1768467930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768467930, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1768467930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1768467930} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1768467930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768467930, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1768467930|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1768467930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1768467930} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:55:20,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 17:55:20,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1381237737 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1381237737 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1381237737 ~y$r_buff0_thd3~0_Out-1381237737)) (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1381237737 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381237737, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1381237737} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381237737, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1381237737, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1381237737|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 17:55:20,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In905116246 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In905116246 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In905116246 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In905116246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out905116246|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In905116246 |P2Thread1of1ForFork0_#t~ite14_Out905116246|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In905116246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In905116246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In905116246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905116246} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out905116246|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In905116246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In905116246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In905116246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In905116246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:55:20,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 17:55:20,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:55:20,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-770089026 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-770089026 256) 0))) (or (and (= ~y$w_buff1~0_In-770089026 |ULTIMATE.start_main_#t~ite18_Out-770089026|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out-770089026| ~y~0_In-770089026) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-770089026, ~y~0=~y~0_In-770089026, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-770089026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-770089026} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-770089026, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-770089026|, ~y~0=~y~0_In-770089026, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-770089026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-770089026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 17:55:20,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-18 17:55:20,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-914784542 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-914784542 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-914784542| ~y$w_buff0_used~0_In-914784542) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-914784542| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-914784542, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-914784542} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-914784542, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-914784542, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-914784542|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:55:20,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1476577969 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1476577969 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1476577969 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1476577969 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1476577969| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1476577969 |ULTIMATE.start_main_#t~ite21_Out1476577969|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1476577969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1476577969, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1476577969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1476577969} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1476577969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1476577969, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1476577969|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1476577969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1476577969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:55:20,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1135745443 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1135745443 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1135745443 |ULTIMATE.start_main_#t~ite22_Out-1135745443|)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1135745443| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135745443, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135745443} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135745443, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1135745443, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1135745443|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:55:20,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2041132750 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2041132750 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In2041132750 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In2041132750 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out2041132750| ~y$r_buff1_thd0~0_In2041132750) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out2041132750| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2041132750, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2041132750, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2041132750, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2041132750} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2041132750, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2041132750, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2041132750, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out2041132750|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2041132750} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:55:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1755618262 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1755618262 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1755618262 256))) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-1755618262 256) 0)) (= (mod ~y$w_buff0_used~0_In-1755618262 256) 0))) (= |ULTIMATE.start_main_#t~ite30_Out-1755618262| |ULTIMATE.start_main_#t~ite29_Out-1755618262|) .cse1 (= ~y$w_buff0~0_In-1755618262 |ULTIMATE.start_main_#t~ite29_Out-1755618262|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out-1755618262| ~y$w_buff0~0_In-1755618262) (= |ULTIMATE.start_main_#t~ite29_In-1755618262| |ULTIMATE.start_main_#t~ite29_Out-1755618262|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1755618262, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1755618262|, ~y$w_buff0~0=~y$w_buff0~0_In-1755618262, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1755618262, ~weak$$choice2~0=~weak$$choice2~0_In-1755618262, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1755618262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755618262} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1755618262|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1755618262, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1755618262|, ~y$w_buff0~0=~y$w_buff0~0_In-1755618262, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1755618262, ~weak$$choice2~0=~weak$$choice2~0_In-1755618262, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1755618262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755618262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:55:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:55:20,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:55:20,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:55:20,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:55:20 BasicIcfg [2019-12-18 17:55:20,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:55:20,198 INFO L168 Benchmark]: Toolchain (without parser) took 21615.45 ms. Allocated memory was 145.8 MB in the beginning and 913.8 MB in the end (delta: 768.1 MB). Free memory was 102.3 MB in the beginning and 731.8 MB in the end (delta: -629.5 MB). Peak memory consumption was 531.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,198 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.05 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 157.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.54 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,204 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,205 INFO L168 Benchmark]: RCFGBuilder took 817.98 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 105.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,206 INFO L168 Benchmark]: TraceAbstraction took 19886.12 ms. Allocated memory was 202.9 MB in the beginning and 913.8 MB in the end (delta: 710.9 MB). Free memory was 104.5 MB in the beginning and 731.8 MB in the end (delta: -627.3 MB). Peak memory consumption was 476.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:20,214 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.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.05 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 157.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.54 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.48 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 817.98 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 105.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19886.12 ms. Allocated memory was 202.9 MB in the beginning and 913.8 MB in the end (delta: 710.9 MB). Free memory was 104.5 MB in the beginning and 731.8 MB in the end (delta: -627.3 MB). Peak memory consumption was 476.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1639 SDtfs, 1679 SDslu, 4773 SDs, 0 SdLazy, 3863 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 5065 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 138171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...