/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:26:56,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:26:56,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:26:56,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:26:56,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:26:56,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:26:56,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:26:56,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:26:56,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:26:56,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:26:56,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:26:56,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:26:56,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:26:56,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:26:56,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:26:56,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:26:56,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:26:56,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:26:56,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:26:56,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:26:56,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:26:56,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:26:56,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:26:56,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:26:56,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:26:56,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:26:56,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:26:56,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:26:56,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:26:56,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:26:56,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:26:56,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:26:56,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:26:56,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:26:56,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:26:56,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:26:56,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:26:56,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:26:56,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:26:56,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:26:56,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:26:56,446 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-VariableLbe-MCR.epf [2019-12-27 20:26:56,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:26:56,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:26:56,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:26:56,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:26:56,466 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:26:56,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:26:56,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:26:56,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:26:56,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:26:56,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:26:56,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:26:56,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:26:56,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:26:56,468 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:26:56,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:26:56,468 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:26:56,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:26:56,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:26:56,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:26:56,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:26:56,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:26:56,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:26:56,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:26:56,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:26:56,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:26:56,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:26:56,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:26:56,471 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:26:56,471 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:26:56,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:26:56,472 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:26:56,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:26:56,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:26:56,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:26:56,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:26:56,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:26:56,755 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:26:56,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-27 20:26:56,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7e36a79/539ef2ec12d74622bc5dab94b143d08b/FLAG00de3e1e8 [2019-12-27 20:26:57,408 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:26:57,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-27 20:26:57,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7e36a79/539ef2ec12d74622bc5dab94b143d08b/FLAG00de3e1e8 [2019-12-27 20:26:57,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7e36a79/539ef2ec12d74622bc5dab94b143d08b [2019-12-27 20:26:57,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:26:57,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:26:57,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:26:57,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:26:57,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:26:57,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:26:57" (1/1) ... [2019-12-27 20:26:57,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:57, skipping insertion in model container [2019-12-27 20:26:57,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:26:57" (1/1) ... [2019-12-27 20:26:57,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:26:57,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:26:58,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:26:58,316 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:26:58,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:26:58,451 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:26:58,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58 WrapperNode [2019-12-27 20:26:58,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:26:58,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:26:58,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:26:58,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:26:58,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:26:58,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:26:58,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:26:58,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:26:58,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (1/1) ... [2019-12-27 20:26:58,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:26:58,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:26:58,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:26:58,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:26:58,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (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-27 20:26:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:26:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:26:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:26:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:26:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:26:58,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:26:58,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:26:58,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:26:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:26:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:26:58,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:26:58,643 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:26:59,362 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:26:59,362 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:26:59,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:26:59 BoogieIcfgContainer [2019-12-27 20:26:59,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:26:59,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:26:59,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:26:59,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:26:59,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:26:57" (1/3) ... [2019-12-27 20:26:59,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d889dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:26:59, skipping insertion in model container [2019-12-27 20:26:59,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:58" (2/3) ... [2019-12-27 20:26:59,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d889dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:26:59, skipping insertion in model container [2019-12-27 20:26:59,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:26:59" (3/3) ... [2019-12-27 20:26:59,374 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.opt.i [2019-12-27 20:26:59,386 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:26:59,386 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:26:59,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:26:59,400 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:26:59,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:59,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:26:59,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:26:59,555 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:26:59,555 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:26:59,555 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:26:59,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:26:59,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:26:59,556 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:26:59,556 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:26:59,572 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 20:26:59,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:26:59,671 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:26:59,671 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:26:59,686 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:26:59,706 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:26:59,773 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:26:59,773 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:26:59,781 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:26:59,798 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:26:59,799 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:27:03,076 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 20:27:03,191 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 20:27:03,191 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 20:27:03,194 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 20:27:03,668 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 20:27:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 20:27:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:27:03,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:03,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:27:03,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 20:27:03,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:03,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485232380] [2019-12-27 20:27:03,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:03,914 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-27 20:27:03,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485232380] [2019-12-27 20:27:03,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:03,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:03,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120113679] [2019-12-27 20:27:03,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:03,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:03,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:27:03,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:03,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:03,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:03,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:03,959 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 20:27:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:04,231 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 20:27:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:04,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:27:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:04,340 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 20:27:04,340 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 20:27:04,342 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-27 20:27:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 20:27:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 20:27:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 20:27:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 20:27:04,865 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 20:27:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:04,866 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 20:27:04,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 20:27:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:27:04,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:04,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:04,873 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 20:27:04,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:04,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068303155] [2019-12-27 20:27:04,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:05,029 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-27 20:27:05,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068303155] [2019-12-27 20:27:05,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:05,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:05,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700100809] [2019-12-27 20:27:05,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:05,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:05,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:27:05,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:05,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:05,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:05,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:05,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:05,042 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 20:27:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:05,481 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 20:27:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:05,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:27:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:05,589 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 20:27:05,590 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 20:27:05,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 20:27:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 20:27:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 20:27:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 20:27:06,217 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 20:27:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:06,218 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 20:27:06,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 20:27:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:27:06,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:06,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:06,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 20:27:06,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:06,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765713786] [2019-12-27 20:27:06,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:06,362 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-27 20:27:06,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765713786] [2019-12-27 20:27:06,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:06,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:06,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760695310] [2019-12-27 20:27:06,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:06,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:06,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:27:06,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:06,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:06,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:06,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:06,370 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 20:27:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:06,628 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 20:27:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:06,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:27:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:06,679 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 20:27:06,679 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 20:27:06,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 20:27:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 20:27:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 20:27:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 20:27:07,798 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 20:27:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:07,802 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 20:27:07,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 20:27:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:27:07,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:07,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:07,806 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 20:27:07,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:07,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709921230] [2019-12-27 20:27:07,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:07,885 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-27 20:27:07,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709921230] [2019-12-27 20:27:07,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:07,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:07,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440719206] [2019-12-27 20:27:07,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:07,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:07,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 20:27:07,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:07,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:07,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:07,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:07,894 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 20:27:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:07,963 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 20:27:07,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:07,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:27:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:07,998 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 20:27:07,999 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 20:27:07,999 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-27 20:27:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 20:27:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 20:27:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 20:27:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 20:27:08,496 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 20:27:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:08,496 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 20:27:08,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 20:27:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:27:08,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:08,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:08,501 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 20:27:08,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:08,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221603536] [2019-12-27 20:27:08,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:08,608 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-27 20:27:08,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221603536] [2019-12-27 20:27:08,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:08,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:27:08,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736482903] [2019-12-27 20:27:08,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:08,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:08,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 20:27:08,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:08,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:27:08,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:08,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:08,622 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-27 20:27:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:08,674 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-27 20:27:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:27:08,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 20:27:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:08,679 INFO L225 Difference]: With dead ends: 2361 [2019-12-27 20:27:08,679 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 20:27:08,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 20:27:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-27 20:27:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 20:27:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-27 20:27:08,710 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-27 20:27:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:08,710 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-27 20:27:08,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-27 20:27:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:27:08,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:08,713 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] [2019-12-27 20:27:08,713 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 20:27:08,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:08,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542558281] [2019-12-27 20:27:08,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:08,838 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-27 20:27:08,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542558281] [2019-12-27 20:27:08,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:08,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:08,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340142889] [2019-12-27 20:27:08,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:08,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:08,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:27:08,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:08,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:08,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:08,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:08,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:08,854 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-27 20:27:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:09,554 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-27 20:27:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:09,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:27:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:09,566 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 20:27:09,567 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 20:27:09,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 20:27:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-27 20:27:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-27 20:27:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-27 20:27:09,618 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-27 20:27:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:09,619 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-27 20:27:09,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-27 20:27:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:09,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:09,622 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-27 20:27:09,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-27 20:27:09,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:09,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630493078] [2019-12-27 20:27:09,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:09,676 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-27 20:27:09,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630493078] [2019-12-27 20:27:09,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:09,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:09,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796156157] [2019-12-27 20:27:09,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:09,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:09,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:27:09,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:09,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:09,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:09,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:09,742 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 4 states. [2019-12-27 20:27:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:09,780 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-27 20:27:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:09,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 20:27:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:09,787 INFO L225 Difference]: With dead ends: 3872 [2019-12-27 20:27:09,788 INFO L226 Difference]: Without dead ends: 2030 [2019-12-27 20:27:09,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 20:27:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-27 20:27:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-27 20:27:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 20:27:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-27 20:27:09,823 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-27 20:27:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:09,824 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-27 20:27:09,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-27 20:27:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:09,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:09,827 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-27 20:27:09,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 20:27:09,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:09,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32304801] [2019-12-27 20:27:09,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:09,943 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-27 20:27:09,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32304801] [2019-12-27 20:27:09,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:09,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:09,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671038221] [2019-12-27 20:27:09,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:09,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:09,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:27:09,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:09,957 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:09,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:09,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:09,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:09,959 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-27 20:27:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:10,473 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-27 20:27:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:10,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:27:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:10,482 INFO L225 Difference]: With dead ends: 3736 [2019-12-27 20:27:10,482 INFO L226 Difference]: Without dead ends: 3707 [2019-12-27 20:27:10,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-27 20:27:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-27 20:27:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 20:27:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-27 20:27:10,527 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-27 20:27:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:10,528 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-27 20:27:10,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-27 20:27:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:27:10,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:10,531 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] [2019-12-27 20:27:10,531 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-27 20:27:10,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:10,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275536224] [2019-12-27 20:27:10,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:10,602 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-27 20:27:10,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275536224] [2019-12-27 20:27:10,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:10,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:27:10,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415786093] [2019-12-27 20:27:10,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:10,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:10,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:27:10,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:10,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:27:10,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:27:10,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:27:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:10,699 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 8 states. [2019-12-27 20:27:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:11,481 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-27 20:27:11,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:27:11,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:27:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:11,488 INFO L225 Difference]: With dead ends: 2989 [2019-12-27 20:27:11,488 INFO L226 Difference]: Without dead ends: 2989 [2019-12-27 20:27:11,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-27 20:27:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-27 20:27:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 20:27:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-27 20:27:11,604 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-27 20:27:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:11,604 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-27 20:27:11,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:27:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-27 20:27:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:27:11,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:11,613 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] [2019-12-27 20:27:11,613 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 20:27:11,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:11,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937926624] [2019-12-27 20:27:11,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:11,739 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-27 20:27:11,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937926624] [2019-12-27 20:27:11,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:11,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:11,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812789291] [2019-12-27 20:27:11,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:11,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:11,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:27:11,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:11,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:27:11,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:11,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:11,780 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 6 states. [2019-12-27 20:27:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:11,835 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-27 20:27:11,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:11,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:27:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:11,838 INFO L225 Difference]: With dead ends: 1549 [2019-12-27 20:27:11,838 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:27:11,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:27:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-27 20:27:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-27 20:27:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-27 20:27:11,858 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-27 20:27:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-27 20:27:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-27 20:27:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:11,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:11,862 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] [2019-12-27 20:27:11,862 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-27 20:27:11,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:11,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467215261] [2019-12-27 20:27:11,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:12,009 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-27 20:27:12,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467215261] [2019-12-27 20:27:12,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:12,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:27:12,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239380400] [2019-12-27 20:27:12,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:12,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:12,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 135 transitions. [2019-12-27 20:27:12,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:12,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:27:12,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:12,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:12,137 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 9 states. [2019-12-27 20:27:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:12,412 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-27 20:27:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:27:12,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:27:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:12,414 INFO L225 Difference]: With dead ends: 2115 [2019-12-27 20:27:12,415 INFO L226 Difference]: Without dead ends: 1423 [2019-12-27 20:27:12,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:27:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-27 20:27:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-27 20:27:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 20:27:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-27 20:27:12,444 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-27 20:27:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:12,446 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-27 20:27:12,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-27 20:27:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:12,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:12,454 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] [2019-12-27 20:27:12,455 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-27 20:27:12,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:12,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535172173] [2019-12-27 20:27:12,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:12,555 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-27 20:27:12,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535172173] [2019-12-27 20:27:12,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:12,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:12,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204828594] [2019-12-27 20:27:12,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:12,571 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:12,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:27:12,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:12,726 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:12,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:12,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:12,727 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 3 states. [2019-12-27 20:27:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:12,811 INFO L93 Difference]: Finished difference Result 1587 states and 3364 transitions. [2019-12-27 20:27:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:12,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:27:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:12,817 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 20:27:12,817 INFO L226 Difference]: Without dead ends: 1587 [2019-12-27 20:27:12,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-27 20:27:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1262. [2019-12-27 20:27:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-27 20:27:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2714 transitions. [2019-12-27 20:27:12,843 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2714 transitions. Word has length 51 [2019-12-27 20:27:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:12,844 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2714 transitions. [2019-12-27 20:27:12,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2714 transitions. [2019-12-27 20:27:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:12,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:12,851 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] [2019-12-27 20:27:12,851 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-27 20:27:12,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:12,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906410457] [2019-12-27 20:27:12,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:13,018 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-27 20:27:13,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906410457] [2019-12-27 20:27:13,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:13,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:27:13,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456871866] [2019-12-27 20:27:13,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:13,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:13,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:13,102 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:13,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:27:13,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:13,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:13,170 INFO L87 Difference]: Start difference. First operand 1262 states and 2714 transitions. Second operand 9 states. [2019-12-27 20:27:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:14,867 INFO L93 Difference]: Finished difference Result 2653 states and 5478 transitions. [2019-12-27 20:27:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:27:14,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:27:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:14,872 INFO L225 Difference]: With dead ends: 2653 [2019-12-27 20:27:14,872 INFO L226 Difference]: Without dead ends: 2653 [2019-12-27 20:27:14,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:27:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-27 20:27:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1286. [2019-12-27 20:27:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-27 20:27:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-27 20:27:14,902 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-27 20:27:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:14,903 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-27 20:27:14,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-27 20:27:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:14,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:14,906 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] [2019-12-27 20:27:14,907 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-27 20:27:14,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:14,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896255522] [2019-12-27 20:27:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:14,986 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-27 20:27:14,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896255522] [2019-12-27 20:27:14,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:14,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:14,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369935548] [2019-12-27 20:27:14,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:15,004 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:15,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:15,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:15,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:15,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:15,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:15,198 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-27 20:27:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:15,509 INFO L93 Difference]: Finished difference Result 1970 states and 4215 transitions. [2019-12-27 20:27:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:15,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:27:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:15,512 INFO L225 Difference]: With dead ends: 1970 [2019-12-27 20:27:15,513 INFO L226 Difference]: Without dead ends: 1970 [2019-12-27 20:27:15,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-27 20:27:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-27 20:27:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1316. [2019-12-27 20:27:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-27 20:27:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2818 transitions. [2019-12-27 20:27:15,542 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2818 transitions. Word has length 52 [2019-12-27 20:27:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:15,542 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2818 transitions. [2019-12-27 20:27:15,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2818 transitions. [2019-12-27 20:27:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:15,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:15,546 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] [2019-12-27 20:27:15,547 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-27 20:27:15,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:15,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444219290] [2019-12-27 20:27:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:15,636 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-27 20:27:15,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444219290] [2019-12-27 20:27:15,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:15,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:15,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339990549] [2019-12-27 20:27:15,638 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:15,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:15,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 120 transitions. [2019-12-27 20:27:15,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:15,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:15,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:15,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:15,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:15,718 INFO L87 Difference]: Start difference. First operand 1316 states and 2818 transitions. Second operand 3 states. [2019-12-27 20:27:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:15,733 INFO L93 Difference]: Finished difference Result 1315 states and 2816 transitions. [2019-12-27 20:27:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:15,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:27:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:15,735 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 20:27:15,735 INFO L226 Difference]: Without dead ends: 1315 [2019-12-27 20:27:15,736 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-27 20:27:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-12-27 20:27:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 935. [2019-12-27 20:27:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-27 20:27:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-27 20:27:15,759 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-27 20:27:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:15,760 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-27 20:27:15,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-27 20:27:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:27:15,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:15,763 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] [2019-12-27 20:27:15,763 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 20:27:15,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:15,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933007331] [2019-12-27 20:27:15,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:15,935 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:27:15,937 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:27:15,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t587~0.base_22| 4)) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= |v_ULTIMATE.start_main_~#t587~0.offset_17| 0) (= v_~y$read_delayed~0_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_22|)) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_22| 1)) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t587~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t587~0.base_22|) |v_ULTIMATE.start_main_~#t587~0.offset_17| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_22|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_15|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_17|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:27:15,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:27:15,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:27:15,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1006689771 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1006689771 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1006689771| ~y$w_buff0_used~0_In1006689771) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1006689771|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1006689771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1006689771} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1006689771|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1006689771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1006689771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:27:15,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In2138694440 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In2138694440 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2138694440 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2138694440 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2138694440 |P0Thread1of1ForFork0_#t~ite6_Out2138694440|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out2138694440| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2138694440, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2138694440, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2138694440, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2138694440} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2138694440|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2138694440, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2138694440, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2138694440, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2138694440} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:27:15,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1284707139 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1284707139 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-1284707139 ~y$r_buff0_thd1~0_In-1284707139)) (and (= ~y$r_buff0_thd1~0_Out-1284707139 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284707139, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1284707139} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284707139, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1284707139|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1284707139} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:27:15,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1672643886 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1672643886 256)))) (or (= (mod ~y$w_buff0_used~0_In1672643886 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1672643886 256))) (and (= (mod ~y$w_buff1_used~0_In1672643886 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1672643886| |P1Thread1of1ForFork1_#t~ite15_Out1672643886|) (= ~y$w_buff0~0_In1672643886 |P1Thread1of1ForFork1_#t~ite14_Out1672643886|)) (and (= ~y$w_buff0~0_In1672643886 |P1Thread1of1ForFork1_#t~ite15_Out1672643886|) (= |P1Thread1of1ForFork1_#t~ite14_In1672643886| |P1Thread1of1ForFork1_#t~ite14_Out1672643886|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1672643886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1672643886, ~y$w_buff0~0=~y$w_buff0~0_In1672643886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1672643886, ~weak$$choice2~0=~weak$$choice2~0_In1672643886, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1672643886|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672643886} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1672643886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1672643886, ~y$w_buff0~0=~y$w_buff0~0_In1672643886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1672643886, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1672643886|, ~weak$$choice2~0=~weak$$choice2~0_In1672643886, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1672643886|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1672643886} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:27:15,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1017875709 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1017875709 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1017875709 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1017875709 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1017875709 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out-1017875709| ~y$w_buff1~0_In-1017875709) .cse1 (= |P1Thread1of1ForFork1_#t~ite17_Out-1017875709| |P1Thread1of1ForFork1_#t~ite18_Out-1017875709|)) (and (= |P1Thread1of1ForFork1_#t~ite17_In-1017875709| |P1Thread1of1ForFork1_#t~ite17_Out-1017875709|) (= ~y$w_buff1~0_In-1017875709 |P1Thread1of1ForFork1_#t~ite18_Out-1017875709|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1017875709, ~y$w_buff1~0=~y$w_buff1~0_In-1017875709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1017875709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1017875709, ~weak$$choice2~0=~weak$$choice2~0_In-1017875709, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1017875709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1017875709} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1017875709, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1017875709|, ~y$w_buff1~0=~y$w_buff1~0_In-1017875709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1017875709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1017875709, ~weak$$choice2~0=~weak$$choice2~0_In-1017875709, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1017875709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1017875709} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:27:15,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In181527277 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In181527277 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In181527277 256)) (and (= 0 (mod ~y$w_buff1_used~0_In181527277 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In181527277 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite20_Out181527277| ~y$w_buff0_used~0_In181527277) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out181527277| |P1Thread1of1ForFork1_#t~ite20_Out181527277|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In181527277| |P1Thread1of1ForFork1_#t~ite20_Out181527277|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out181527277| ~y$w_buff0_used~0_In181527277)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In181527277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In181527277, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In181527277|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In181527277, ~weak$$choice2~0=~weak$$choice2~0_In181527277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In181527277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In181527277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In181527277, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out181527277|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In181527277, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out181527277|, ~weak$$choice2~0=~weak$$choice2~0_In181527277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In181527277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:27:15,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:27:15,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1398158772 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-1398158772 |P1Thread1of1ForFork1_#t~ite30_Out-1398158772|) (= |P1Thread1of1ForFork1_#t~ite29_In-1398158772| |P1Thread1of1ForFork1_#t~ite29_Out-1398158772|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1398158772| |P1Thread1of1ForFork1_#t~ite30_Out-1398158772|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1398158772 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1398158772 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1398158772 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1398158772 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1398158772| ~y$r_buff1_thd2~0_In-1398158772)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1398158772, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1398158772|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398158772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1398158772, ~weak$$choice2~0=~weak$$choice2~0_In-1398158772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398158772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1398158772, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1398158772|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1398158772|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398158772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1398158772, ~weak$$choice2~0=~weak$$choice2~0_In-1398158772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398158772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 20:27:15,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1701534044 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1701534044 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1701534044 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1701534044 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1701534044| ~y$r_buff1_thd1~0_In-1701534044)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1701534044| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1701534044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701534044, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1701534044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701534044} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1701534044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701534044, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1701534044|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1701534044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701534044} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:27:15,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:27:15,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:27:15,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In458136706 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In458136706 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out458136706| ~y~0_In458136706)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out458136706| ~y$w_buff1~0_In458136706) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In458136706, ~y$w_buff1~0=~y$w_buff1~0_In458136706, ~y~0=~y~0_In458136706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458136706} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In458136706, ~y$w_buff1~0=~y$w_buff1~0_In458136706, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out458136706|, ~y~0=~y~0_In458136706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In458136706} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:27:15,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 20:27:15,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1685163369 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1685163369 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1685163369|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1685163369 |P1Thread1of1ForFork1_#t~ite34_Out-1685163369|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1685163369, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1685163369} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1685163369, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1685163369, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1685163369|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:27:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-942360757 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-942360757 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-942360757 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-942360757 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-942360757| 0)) (and (= ~y$w_buff1_used~0_In-942360757 |P1Thread1of1ForFork1_#t~ite35_Out-942360757|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-942360757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-942360757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-942360757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-942360757} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-942360757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-942360757, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-942360757, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-942360757|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-942360757} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:27:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2046287273 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2046287273 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-2046287273| ~y$r_buff0_thd2~0_In-2046287273) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2046287273|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2046287273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2046287273} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2046287273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2046287273, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2046287273|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:27:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In841970064 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In841970064 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In841970064 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In841970064 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out841970064| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out841970064| ~y$r_buff1_thd2~0_In841970064) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In841970064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In841970064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In841970064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In841970064} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In841970064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In841970064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In841970064, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out841970064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In841970064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:15,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:27:15,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1464858873 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1464858873 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1464858873 |ULTIMATE.start_main_#t~ite40_Out-1464858873|)) (and (not .cse0) (= ~y$w_buff1~0_In-1464858873 |ULTIMATE.start_main_#t~ite40_Out-1464858873|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1464858873, ~y~0=~y~0_In-1464858873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1464858873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464858873} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1464858873|, ~y$w_buff1~0=~y$w_buff1~0_In-1464858873, ~y~0=~y~0_In-1464858873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1464858873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464858873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:27:15,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:27:15,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-952517198 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-952517198 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-952517198|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-952517198 |ULTIMATE.start_main_#t~ite42_Out-952517198|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-952517198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-952517198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-952517198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-952517198, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-952517198|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:27:15,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1179887207 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1179887207 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1179887207 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1179887207 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1179887207| ~y$w_buff1_used~0_In-1179887207) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1179887207| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1179887207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1179887207, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1179887207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1179887207} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1179887207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1179887207, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1179887207|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1179887207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1179887207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:27:15,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-919165022 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-919165022 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-919165022| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-919165022| ~y$r_buff0_thd0~0_In-919165022) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-919165022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-919165022} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-919165022, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-919165022, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-919165022|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:27:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1848716841 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1848716841 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1848716841 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1848716841 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1848716841| ~y$r_buff1_thd0~0_In-1848716841) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1848716841|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848716841, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1848716841, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1848716841, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1848716841} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848716841, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1848716841, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1848716841, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1848716841|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1848716841} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:27:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:27:16,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:27:16 BasicIcfg [2019-12-27 20:27:16,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:27:16,034 INFO L168 Benchmark]: Toolchain (without parser) took 18351.55 ms. Allocated memory was 138.4 MB in the beginning and 745.0 MB in the end (delta: 606.6 MB). Free memory was 101.4 MB in the beginning and 342.6 MB in the end (delta: -241.2 MB). Peak memory consumption was 365.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,035 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.40 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 157.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.77 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,037 INFO L168 Benchmark]: Boogie Preprocessor took 37.40 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,038 INFO L168 Benchmark]: RCFGBuilder took 810.56 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 108.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,038 INFO L168 Benchmark]: TraceAbstraction took 16667.61 ms. Allocated memory was 202.9 MB in the beginning and 745.0 MB in the end (delta: 542.1 MB). Free memory was 107.7 MB in the beginning and 342.6 MB in the end (delta: -235.0 MB). Peak memory consumption was 307.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:16,042 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.40 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 157.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.77 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.40 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.56 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 108.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16667.61 ms. Allocated memory was 202.9 MB in the beginning and 745.0 MB in the end (delta: 542.1 MB). Free memory was 107.7 MB in the beginning and 342.6 MB in the end (delta: -235.0 MB). Peak memory consumption was 307.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1964 SDtfs, 2317 SDslu, 4291 SDs, 0 SdLazy, 3226 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 10392 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 50628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...