/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:14:44,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:14:44,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:14:44,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:14:44,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:14:44,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:14:44,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:14:44,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:14:44,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:14:44,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:14:44,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:14:44,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:14:44,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:14:44,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:14:44,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:14:44,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:14:44,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:14:44,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:14:44,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:14:44,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:14:44,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:14:44,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:14:44,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:14:44,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:14:44,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:14:44,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:14:44,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:14:44,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:14:44,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:14:44,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:14:44,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:14:44,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:14:44,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:14:44,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:14:44,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:14:44,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:14:44,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:14:44,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:14:44,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:14:44,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:14:44,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:14:44,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:14:44,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:14:44,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:14:44,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:14:44,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:14:44,564 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:14:44,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:14:44,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:14:44,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:14:44,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:14:44,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:14:44,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:14:44,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:14:44,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:14:44,566 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:14:44,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:14:44,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:14:44,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:14:44,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:14:44,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:14:44,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:14:44,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:14:44,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:14:44,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:14:44,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:14:44,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:14:44,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:14:44,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:14:44,569 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:14:44,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:14:44,569 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:14:44,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:14:44,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:14:44,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:14:44,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:14:44,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:14:44,861 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:14:44,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i [2019-12-27 18:14:44,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c64a4fb1/1e9e629a711440c9bf92dac4d3048f7c/FLAG29f151283 [2019-12-27 18:14:45,569 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:14:45,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_rmo.opt.i [2019-12-27 18:14:45,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c64a4fb1/1e9e629a711440c9bf92dac4d3048f7c/FLAG29f151283 [2019-12-27 18:14:45,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c64a4fb1/1e9e629a711440c9bf92dac4d3048f7c [2019-12-27 18:14:45,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:14:45,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:14:45,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:14:45,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:14:45,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:14:45,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:45" (1/1) ... [2019-12-27 18:14:45,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d0f8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:45, skipping insertion in model container [2019-12-27 18:14:45,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:45" (1/1) ... [2019-12-27 18:14:45,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:14:45,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:14:46,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:14:46,347 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:14:46,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:14:46,503 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:14:46,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46 WrapperNode [2019-12-27 18:14:46,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:14:46,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:14:46,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:14:46,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:14:46,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:14:46,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:14:46,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:14:46,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:14:46,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (1/1) ... [2019-12-27 18:14:46,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:14:46,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:14:46,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:14:46,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:14:46,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (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 18:14:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:14:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:14:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:14:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:14:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:14:46,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:14:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:14:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:14:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:14:46,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:14:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:14:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:14:46,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:14:46,691 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 18:14:47,433 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:14:47,433 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:14:47,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:47 BoogieIcfgContainer [2019-12-27 18:14:47,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:14:47,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:14:47,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:14:47,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:14:47,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:14:45" (1/3) ... [2019-12-27 18:14:47,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb23124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:47, skipping insertion in model container [2019-12-27 18:14:47,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:46" (2/3) ... [2019-12-27 18:14:47,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb23124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:47, skipping insertion in model container [2019-12-27 18:14:47,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:47" (3/3) ... [2019-12-27 18:14:47,444 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_rmo.opt.i [2019-12-27 18:14:47,454 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:14:47,455 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:14:47,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:14:47,464 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:14:47,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,509 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,509 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,555 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,589 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,589 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,609 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:14:47,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:14:47,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:14:47,650 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:14:47,650 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:14:47,650 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:14:47,650 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:14:47,650 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:14:47,650 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:14:47,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:14:47,679 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 18:14:47,681 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:14:47,782 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:14:47,783 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:14:47,801 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:14:47,822 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:14:47,888 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:14:47,889 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:14:47,897 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:14:47,917 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:14:47,918 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:14:53,300 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-27 18:14:53,590 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 18:14:53,709 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 18:14:53,802 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-27 18:14:53,803 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 18:14:53,807 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-27 18:15:03,758 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-27 18:15:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-27 18:15:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:15:03,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:03,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:15:03,767 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-27 18:15:03,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:03,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352970538] [2019-12-27 18:15:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:04,130 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 18:15:04,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352970538] [2019-12-27 18:15:04,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:04,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:15:04,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068925145] [2019-12-27 18:15:04,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:04,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:04,156 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:15:04,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:04,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:04,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:15:04,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:04,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:15:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:15:04,179 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-27 18:15:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:06,684 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-27 18:15:06,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:15:06,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:15:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:07,250 INFO L225 Difference]: With dead ends: 79136 [2019-12-27 18:15:07,250 INFO L226 Difference]: Without dead ends: 74600 [2019-12-27 18:15:07,251 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 18:15:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-27 18:15:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-27 18:15:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-27 18:15:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-27 18:15:14,026 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-27 18:15:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:14,026 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-27 18:15:14,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:15:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-27 18:15:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:15:14,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:14,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:14,037 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-27 18:15:14,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:14,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817695308] [2019-12-27 18:15:14,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:14,133 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 18:15:14,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817695308] [2019-12-27 18:15:14,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:14,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:15:14,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615095668] [2019-12-27 18:15:14,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:14,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:14,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:15:14,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:14,143 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:14,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:15:14,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:15:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:15:14,146 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-27 18:15:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:17,636 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-27 18:15:17,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:15:17,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:15:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:18,229 INFO L225 Difference]: With dead ends: 114840 [2019-12-27 18:15:18,229 INFO L226 Difference]: Without dead ends: 114749 [2019-12-27 18:15:18,230 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 18:15:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-27 18:15:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-27 18:15:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-27 18:15:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-27 18:15:30,160 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-27 18:15:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:30,162 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-27 18:15:30,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:15:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-27 18:15:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:15:30,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:30,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:30,166 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-27 18:15:30,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:30,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675374201] [2019-12-27 18:15:30,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:30,250 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 18:15:30,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675374201] [2019-12-27 18:15:30,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:30,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:15:30,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187142019] [2019-12-27 18:15:30,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:30,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:30,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:15:30,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:30,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:15:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:15:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:15:30,257 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-27 18:15:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:31,272 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-27 18:15:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:15:31,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:15:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:33,108 INFO L225 Difference]: With dead ends: 148763 [2019-12-27 18:15:33,109 INFO L226 Difference]: Without dead ends: 148659 [2019-12-27 18:15:33,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:15:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-27 18:15:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-27 18:15:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-27 18:15:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-27 18:15:44,081 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-27 18:15:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:44,082 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-27 18:15:44,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:15:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-27 18:15:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:15:44,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:44,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:44,088 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:44,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-27 18:15:44,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:44,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509906273] [2019-12-27 18:15:44,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:44,177 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 18:15:44,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509906273] [2019-12-27 18:15:44,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:44,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:15:44,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1912684493] [2019-12-27 18:15:44,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:44,180 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:44,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:15:44,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:44,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:15:44,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:15:44,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:44,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:15:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:15:44,266 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 7 states. [2019-12-27 18:15:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:45,663 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-27 18:15:45,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:15:45,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 18:15:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:47,455 INFO L225 Difference]: With dead ends: 172949 [2019-12-27 18:15:47,456 INFO L226 Difference]: Without dead ends: 172813 [2019-12-27 18:15:47,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:15:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-27 18:16:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-27 18:16:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-27 18:16:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-27 18:16:01,023 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-27 18:16:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:01,023 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-27 18:16:01,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:16:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-27 18:16:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:16:01,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:01,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:01,045 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-27 18:16:01,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:01,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660946355] [2019-12-27 18:16:01,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:01,121 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 18:16:01,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660946355] [2019-12-27 18:16:01,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:01,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:16:01,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055661270] [2019-12-27 18:16:01,122 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:01,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:01,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:16:01,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:01,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:16:01,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:16:01,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:16:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:16:01,128 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-27 18:16:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:01,778 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-27 18:16:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:16:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:16:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:07,290 INFO L225 Difference]: With dead ends: 133799 [2019-12-27 18:16:07,290 INFO L226 Difference]: Without dead ends: 133799 [2019-12-27 18:16:07,290 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 18:16:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-27 18:16:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-27 18:16:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-27 18:16:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-27 18:16:14,057 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-27 18:16:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:14,057 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-27 18:16:14,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:16:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-27 18:16:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:16:14,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:14,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:14,080 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-27 18:16:14,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:14,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060945655] [2019-12-27 18:16:14,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:14,137 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 18:16:14,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060945655] [2019-12-27 18:16:14,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:14,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:14,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72899299] [2019-12-27 18:16:14,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:14,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:14,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 48 transitions. [2019-12-27 18:16:14,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:14,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:16:14,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:16:14,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:16:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:16:14,146 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-27 18:16:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:21,113 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-27 18:16:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:16:21,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 18:16:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:21,528 INFO L225 Difference]: With dead ends: 243998 [2019-12-27 18:16:21,528 INFO L226 Difference]: Without dead ends: 133380 [2019-12-27 18:16:21,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 18:16:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-27 18:16:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-27 18:16:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-27 18:16:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-27 18:16:28,365 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-27 18:16:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:28,366 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-27 18:16:28,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:16:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-27 18:16:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:16:28,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:28,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:28,380 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-27 18:16:28,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:28,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146850495] [2019-12-27 18:16:28,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:28,462 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 18:16:28,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146850495] [2019-12-27 18:16:28,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:28,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:16:28,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107153428] [2019-12-27 18:16:28,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:28,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:28,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:16:28,469 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:28,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:16:28,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:16:28,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:28,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:16:28,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:28,471 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-27 18:16:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:34,983 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-27 18:16:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:16:34,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:16:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:35,502 INFO L225 Difference]: With dead ends: 182821 [2019-12-27 18:16:35,502 INFO L226 Difference]: Without dead ends: 181141 [2019-12-27 18:16:35,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:16:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-27 18:16:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-27 18:16:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-27 18:16:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-27 18:16:42,784 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-27 18:16:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:42,784 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-27 18:16:42,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:16:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-27 18:16:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 18:16:42,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:42,801 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] [2019-12-27 18:16:42,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-27 18:16:42,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:42,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077307712] [2019-12-27 18:16:42,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:42,879 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 18:16:42,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077307712] [2019-12-27 18:16:42,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:42,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:42,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [841591245] [2019-12-27 18:16:42,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:42,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:42,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 65 transitions. [2019-12-27 18:16:42,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:42,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:16:42,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:16:42,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:42,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:16:42,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:16:42,955 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 8 states. [2019-12-27 18:16:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:48,168 INFO L93 Difference]: Finished difference Result 331392 states and 1367958 transitions. [2019-12-27 18:16:48,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:16:48,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-27 18:16:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:48,841 INFO L225 Difference]: With dead ends: 331392 [2019-12-27 18:16:48,841 INFO L226 Difference]: Without dead ends: 217880 [2019-12-27 18:16:48,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:17:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217880 states. [2019-12-27 18:17:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217880 to 88607. [2019-12-27 18:17:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-27 18:17:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-27 18:17:02,880 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-27 18:17:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:02,880 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-27 18:17:02,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:17:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-27 18:17:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:17:02,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:02,895 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] [2019-12-27 18:17:02,895 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-27 18:17:02,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:02,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189800568] [2019-12-27 18:17:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:02,968 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 18:17:02,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189800568] [2019-12-27 18:17:02,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:02,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:02,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54221852] [2019-12-27 18:17:02,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:02,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:02,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 75 transitions. [2019-12-27 18:17:02,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:02,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:17:02,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:17:02,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:02,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:17:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:17:02,988 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 3 states. [2019-12-27 18:17:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:03,369 INFO L93 Difference]: Finished difference Result 84552 states and 342415 transitions. [2019-12-27 18:17:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:03,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 18:17:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:03,587 INFO L225 Difference]: With dead ends: 84552 [2019-12-27 18:17:03,588 INFO L226 Difference]: Without dead ends: 84552 [2019-12-27 18:17:03,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:17:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84552 states. [2019-12-27 18:17:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84552 to 84552. [2019-12-27 18:17:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84552 states. [2019-12-27 18:17:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84552 states to 84552 states and 342415 transitions. [2019-12-27 18:17:11,816 INFO L78 Accepts]: Start accepts. Automaton has 84552 states and 342415 transitions. Word has length 21 [2019-12-27 18:17:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:11,816 INFO L462 AbstractCegarLoop]: Abstraction has 84552 states and 342415 transitions. [2019-12-27 18:17:11,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:17:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 84552 states and 342415 transitions. [2019-12-27 18:17:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:11,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:11,830 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] [2019-12-27 18:17:11,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash 120078242, now seen corresponding path program 1 times [2019-12-27 18:17:11,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:11,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553738923] [2019-12-27 18:17:11,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:11,907 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 18:17:11,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553738923] [2019-12-27 18:17:11,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:11,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:17:11,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337741173] [2019-12-27 18:17:11,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:11,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:11,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:17:11,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:12,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:17:12,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:17:12,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:17:12,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:17:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:17:12,675 INFO L87 Difference]: Start difference. First operand 84552 states and 342415 transitions. Second operand 10 states. [2019-12-27 18:17:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:14,349 INFO L93 Difference]: Finished difference Result 128943 states and 503000 transitions. [2019-12-27 18:17:14,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:17:14,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 18:17:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:14,677 INFO L225 Difference]: With dead ends: 128943 [2019-12-27 18:17:14,678 INFO L226 Difference]: Without dead ends: 126131 [2019-12-27 18:17:14,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:17:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126131 states. [2019-12-27 18:17:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126131 to 99741. [2019-12-27 18:17:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99741 states. [2019-12-27 18:17:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99741 states to 99741 states and 399345 transitions. [2019-12-27 18:17:24,148 INFO L78 Accepts]: Start accepts. Automaton has 99741 states and 399345 transitions. Word has length 22 [2019-12-27 18:17:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:24,149 INFO L462 AbstractCegarLoop]: Abstraction has 99741 states and 399345 transitions. [2019-12-27 18:17:24,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:17:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 99741 states and 399345 transitions. [2019-12-27 18:17:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:24,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:24,163 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] [2019-12-27 18:17:24,163 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-27 18:17:24,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:24,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070639791] [2019-12-27 18:17:24,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:24,250 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 18:17:24,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070639791] [2019-12-27 18:17:24,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:24,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:17:24,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1914617067] [2019-12-27 18:17:24,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:24,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:24,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 18:17:24,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:24,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:17:24,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:17:24,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:17:24,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:24,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:17:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:17:24,411 INFO L87 Difference]: Start difference. First operand 99741 states and 399345 transitions. Second operand 10 states. [2019-12-27 18:17:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:25,659 INFO L93 Difference]: Finished difference Result 102103 states and 404946 transitions. [2019-12-27 18:17:25,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:17:25,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 18:17:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:25,918 INFO L225 Difference]: With dead ends: 102103 [2019-12-27 18:17:25,919 INFO L226 Difference]: Without dead ends: 99113 [2019-12-27 18:17:25,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:17:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99113 states. [2019-12-27 18:17:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99113 to 98620. [2019-12-27 18:17:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98620 states. [2019-12-27 18:17:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98620 states to 98620 states and 395258 transitions. [2019-12-27 18:17:35,747 INFO L78 Accepts]: Start accepts. Automaton has 98620 states and 395258 transitions. Word has length 22 [2019-12-27 18:17:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:35,747 INFO L462 AbstractCegarLoop]: Abstraction has 98620 states and 395258 transitions. [2019-12-27 18:17:35,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:17:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 98620 states and 395258 transitions. [2019-12-27 18:17:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:35,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:35,764 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] [2019-12-27 18:17:35,765 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135073, now seen corresponding path program 1 times [2019-12-27 18:17:35,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:35,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807137652] [2019-12-27 18:17:35,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:35,868 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 18:17:35,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807137652] [2019-12-27 18:17:35,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:35,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:35,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346703563] [2019-12-27 18:17:35,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:35,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:35,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 48 transitions. [2019-12-27 18:17:35,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:35,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:17:35,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:35,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:35,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:35,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:35,900 INFO L87 Difference]: Start difference. First operand 98620 states and 395258 transitions. Second operand 5 states. [2019-12-27 18:17:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:36,168 INFO L93 Difference]: Finished difference Result 27636 states and 94922 transitions. [2019-12-27 18:17:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:36,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 18:17:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:36,209 INFO L225 Difference]: With dead ends: 27636 [2019-12-27 18:17:36,209 INFO L226 Difference]: Without dead ends: 23440 [2019-12-27 18:17:36,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23440 states. [2019-12-27 18:17:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23440 to 15386. [2019-12-27 18:17:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15386 states. [2019-12-27 18:17:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15386 states to 15386 states and 51412 transitions. [2019-12-27 18:17:36,560 INFO L78 Accepts]: Start accepts. Automaton has 15386 states and 51412 transitions. Word has length 22 [2019-12-27 18:17:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:36,561 INFO L462 AbstractCegarLoop]: Abstraction has 15386 states and 51412 transitions. [2019-12-27 18:17:36,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15386 states and 51412 transitions. [2019-12-27 18:17:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:17:36,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:36,570 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] [2019-12-27 18:17:36,570 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-27 18:17:36,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:36,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050074086] [2019-12-27 18:17:36,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:36,667 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 18:17:36,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050074086] [2019-12-27 18:17:36,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:36,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:17:36,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [863767370] [2019-12-27 18:17:36,668 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:36,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:36,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 18:17:36,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:36,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:17:36,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:36,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:36,722 INFO L87 Difference]: Start difference. First operand 15386 states and 51412 transitions. Second operand 6 states. [2019-12-27 18:17:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:36,793 INFO L93 Difference]: Finished difference Result 6122 states and 19010 transitions. [2019-12-27 18:17:36,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:36,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 18:17:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:36,801 INFO L225 Difference]: With dead ends: 6122 [2019-12-27 18:17:36,801 INFO L226 Difference]: Without dead ends: 5211 [2019-12-27 18:17:36,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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 18:17:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2019-12-27 18:17:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 5211. [2019-12-27 18:17:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2019-12-27 18:17:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 15988 transitions. [2019-12-27 18:17:36,879 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 15988 transitions. Word has length 31 [2019-12-27 18:17:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:36,879 INFO L462 AbstractCegarLoop]: Abstraction has 5211 states and 15988 transitions. [2019-12-27 18:17:36,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 15988 transitions. [2019-12-27 18:17:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:17:36,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:36,886 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] [2019-12-27 18:17:36,886 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-27 18:17:36,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:36,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019838704] [2019-12-27 18:17:36,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:36,990 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 18:17:36,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019838704] [2019-12-27 18:17:36,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:36,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:17:36,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083526249] [2019-12-27 18:17:36,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:37,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:37,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 204 transitions. [2019-12-27 18:17:37,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:37,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:17:37,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:17:37,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:17:37,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:37,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:17:37,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:17:37,348 INFO L87 Difference]: Start difference. First operand 5211 states and 15988 transitions. Second operand 13 states. [2019-12-27 18:17:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:40,405 INFO L93 Difference]: Finished difference Result 18075 states and 53467 transitions. [2019-12-27 18:17:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:17:40,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-12-27 18:17:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:40,431 INFO L225 Difference]: With dead ends: 18075 [2019-12-27 18:17:40,431 INFO L226 Difference]: Without dead ends: 17207 [2019-12-27 18:17:40,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:17:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17207 states. [2019-12-27 18:17:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17207 to 6318. [2019-12-27 18:17:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6318 states. [2019-12-27 18:17:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 19576 transitions. [2019-12-27 18:17:40,595 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 19576 transitions. Word has length 40 [2019-12-27 18:17:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:40,596 INFO L462 AbstractCegarLoop]: Abstraction has 6318 states and 19576 transitions. [2019-12-27 18:17:40,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:17:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 19576 transitions. [2019-12-27 18:17:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:17:40,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:40,602 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] [2019-12-27 18:17:40,602 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1495792125, now seen corresponding path program 1 times [2019-12-27 18:17:40,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:40,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031412808] [2019-12-27 18:17:40,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:40,688 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 18:17:40,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031412808] [2019-12-27 18:17:40,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:40,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:17:40,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030605831] [2019-12-27 18:17:40,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:40,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:40,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 190 transitions. [2019-12-27 18:17:40,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:40,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:17:40,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:17:40,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:17:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:17:40,796 INFO L87 Difference]: Start difference. First operand 6318 states and 19576 transitions. Second operand 8 states. [2019-12-27 18:17:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:41,634 INFO L93 Difference]: Finished difference Result 10620 states and 32269 transitions. [2019-12-27 18:17:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:17:41,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 18:17:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:41,661 INFO L225 Difference]: With dead ends: 10620 [2019-12-27 18:17:41,662 INFO L226 Difference]: Without dead ends: 10620 [2019-12-27 18:17:41,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 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 18:17:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2019-12-27 18:17:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 9094. [2019-12-27 18:17:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9094 states. [2019-12-27 18:17:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9094 states to 9094 states and 27994 transitions. [2019-12-27 18:17:41,972 INFO L78 Accepts]: Start accepts. Automaton has 9094 states and 27994 transitions. Word has length 41 [2019-12-27 18:17:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:41,972 INFO L462 AbstractCegarLoop]: Abstraction has 9094 states and 27994 transitions. [2019-12-27 18:17:41,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:17:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 9094 states and 27994 transitions. [2019-12-27 18:17:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:17:41,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:41,990 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] [2019-12-27 18:17:41,991 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash 860786557, now seen corresponding path program 2 times [2019-12-27 18:17:41,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:41,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315626964] [2019-12-27 18:17:41,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:42,102 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 18:17:42,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315626964] [2019-12-27 18:17:42,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:42,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:42,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625737577] [2019-12-27 18:17:42,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:42,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:42,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 188 transitions. [2019-12-27 18:17:42,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:42,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:17:42,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:17:42,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:17:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:17:42,208 INFO L87 Difference]: Start difference. First operand 9094 states and 27994 transitions. Second operand 4 states. [2019-12-27 18:17:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:42,538 INFO L93 Difference]: Finished difference Result 11533 states and 34607 transitions. [2019-12-27 18:17:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:42,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 18:17:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:42,567 INFO L225 Difference]: With dead ends: 11533 [2019-12-27 18:17:42,567 INFO L226 Difference]: Without dead ends: 11533 [2019-12-27 18:17:42,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 18:17:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2019-12-27 18:17:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 8520. [2019-12-27 18:17:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8520 states. [2019-12-27 18:17:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8520 states to 8520 states and 25774 transitions. [2019-12-27 18:17:43,446 INFO L78 Accepts]: Start accepts. Automaton has 8520 states and 25774 transitions. Word has length 41 [2019-12-27 18:17:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:43,447 INFO L462 AbstractCegarLoop]: Abstraction has 8520 states and 25774 transitions. [2019-12-27 18:17:43,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:17:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8520 states and 25774 transitions. [2019-12-27 18:17:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 18:17:43,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:43,460 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] [2019-12-27 18:17:43,460 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash -598466109, now seen corresponding path program 1 times [2019-12-27 18:17:43,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:43,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802113398] [2019-12-27 18:17:43,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:43,552 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 18:17:43,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802113398] [2019-12-27 18:17:43,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:43,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:17:43,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091387893] [2019-12-27 18:17:43,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:43,562 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:43,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 168 transitions. [2019-12-27 18:17:43,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:43,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:17:43,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:43,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:43,617 INFO L87 Difference]: Start difference. First operand 8520 states and 25774 transitions. Second operand 6 states. [2019-12-27 18:17:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:43,718 INFO L93 Difference]: Finished difference Result 7541 states and 23395 transitions. [2019-12-27 18:17:43,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:17:43,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 18:17:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:43,730 INFO L225 Difference]: With dead ends: 7541 [2019-12-27 18:17:43,730 INFO L226 Difference]: Without dead ends: 7437 [2019-12-27 18:17:43,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:17:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2019-12-27 18:17:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 7059. [2019-12-27 18:17:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7059 states. [2019-12-27 18:17:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 22094 transitions. [2019-12-27 18:17:43,843 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 22094 transitions. Word has length 42 [2019-12-27 18:17:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:43,843 INFO L462 AbstractCegarLoop]: Abstraction has 7059 states and 22094 transitions. [2019-12-27 18:17:43,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 22094 transitions. [2019-12-27 18:17:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:17:43,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:43,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:43,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1916857338, now seen corresponding path program 1 times [2019-12-27 18:17:43,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:43,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270409893] [2019-12-27 18:17:43,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:43,890 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 18:17:43,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270409893] [2019-12-27 18:17:43,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:43,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:43,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470641997] [2019-12-27 18:17:43,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:43,910 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:44,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 222 transitions. [2019-12-27 18:17:44,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:44,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:17:44,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:17:44,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:17:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:17:44,028 INFO L87 Difference]: Start difference. First operand 7059 states and 22094 transitions. Second operand 3 states. [2019-12-27 18:17:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:44,119 INFO L93 Difference]: Finished difference Result 9608 states and 29408 transitions. [2019-12-27 18:17:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:44,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 18:17:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:44,137 INFO L225 Difference]: With dead ends: 9608 [2019-12-27 18:17:44,138 INFO L226 Difference]: Without dead ends: 9608 [2019-12-27 18:17:44,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:17:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. [2019-12-27 18:17:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9608 to 7459. [2019-12-27 18:17:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7459 states. [2019-12-27 18:17:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7459 states to 7459 states and 23229 transitions. [2019-12-27 18:17:44,303 INFO L78 Accepts]: Start accepts. Automaton has 7459 states and 23229 transitions. Word has length 56 [2019-12-27 18:17:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:44,303 INFO L462 AbstractCegarLoop]: Abstraction has 7459 states and 23229 transitions. [2019-12-27 18:17:44,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:17:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 7459 states and 23229 transitions. [2019-12-27 18:17:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:17:44,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:44,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:44,311 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-27 18:17:44,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:44,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897979500] [2019-12-27 18:17:44,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:44,508 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 18:17:44,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897979500] [2019-12-27 18:17:44,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:44,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:17:44,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [606877859] [2019-12-27 18:17:44,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:44,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:44,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 192 transitions. [2019-12-27 18:17:44,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:44,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:17:44,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:17:44,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:17:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:17:44,892 INFO L87 Difference]: Start difference. First operand 7459 states and 23229 transitions. Second operand 15 states. [2019-12-27 18:17:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:46,623 INFO L93 Difference]: Finished difference Result 14259 states and 43554 transitions. [2019-12-27 18:17:46,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 18:17:46,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 18:17:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:46,638 INFO L225 Difference]: With dead ends: 14259 [2019-12-27 18:17:46,638 INFO L226 Difference]: Without dead ends: 9626 [2019-12-27 18:17:46,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 18:17:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2019-12-27 18:17:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 8740. [2019-12-27 18:17:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8740 states. [2019-12-27 18:17:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8740 states to 8740 states and 26470 transitions. [2019-12-27 18:17:46,772 INFO L78 Accepts]: Start accepts. Automaton has 8740 states and 26470 transitions. Word has length 56 [2019-12-27 18:17:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:46,772 INFO L462 AbstractCegarLoop]: Abstraction has 8740 states and 26470 transitions. [2019-12-27 18:17:46,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:17:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8740 states and 26470 transitions. [2019-12-27 18:17:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:17:46,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:46,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:46,785 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 2 times [2019-12-27 18:17:46,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:46,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933394738] [2019-12-27 18:17:46,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:46,979 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 18:17:46,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933394738] [2019-12-27 18:17:46,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:17:46,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330878747] [2019-12-27 18:17:46,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:46,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:47,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 226 transitions. [2019-12-27 18:17:47,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:47,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:17:47,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:17:47,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:17:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:17:47,305 INFO L87 Difference]: Start difference. First operand 8740 states and 26470 transitions. Second operand 16 states. [2019-12-27 18:17:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:48,365 INFO L93 Difference]: Finished difference Result 10008 states and 29612 transitions. [2019-12-27 18:17:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:17:48,365 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 18:17:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:48,379 INFO L225 Difference]: With dead ends: 10008 [2019-12-27 18:17:48,379 INFO L226 Difference]: Without dead ends: 9294 [2019-12-27 18:17:48,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:17:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9294 states. [2019-12-27 18:17:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9294 to 8552. [2019-12-27 18:17:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8552 states. [2019-12-27 18:17:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8552 states to 8552 states and 25927 transitions. [2019-12-27 18:17:48,507 INFO L78 Accepts]: Start accepts. Automaton has 8552 states and 25927 transitions. Word has length 56 [2019-12-27 18:17:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:48,507 INFO L462 AbstractCegarLoop]: Abstraction has 8552 states and 25927 transitions. [2019-12-27 18:17:48,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:17:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 8552 states and 25927 transitions. [2019-12-27 18:17:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:17:48,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:48,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:48,521 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 3 times [2019-12-27 18:17:48,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:48,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359710859] [2019-12-27 18:17:48,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:17:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:17:48,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:17:48,655 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:17:48,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25|) |v_ULTIMATE.start_main_~#t2064~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2064~0.base_25|) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (= 0 |v_ULTIMATE.start_main_~#t2064~0.offset_19|) (= 0 v_~x~0_230) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25|)) (= v_~weak$$choice2~0_176 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| 4)) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_~#t2064~0.offset=|v_ULTIMATE.start_main_~#t2064~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2064~0.base=|v_ULTIMATE.start_main_~#t2064~0.base_25|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_19|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_21|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2064~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2064~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2065~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2065~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:17:48,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2065~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| 4)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10| 1) |v_#valid_31|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2065~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2065~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10|) |v_ULTIMATE.start_main_~#t2065~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_10|, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2065~0.base, ULTIMATE.start_main_~#t2065~0.offset] because there is no mapped edge [2019-12-27 18:17:48,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2066~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11|) |v_ULTIMATE.start_main_~#t2066~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2066~0.base_11|) (= |v_ULTIMATE.start_main_~#t2066~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_11|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:17:48,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:17:48,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1497647242 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1497647242 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1497647242| ~x$w_buff1~0_In1497647242) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out1497647242| ~x~0_In1497647242) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1497647242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1497647242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1497647242, ~x~0=~x~0_In1497647242} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1497647242|, ~x$w_buff1~0=~x$w_buff1~0_In1497647242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1497647242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1497647242, ~x~0=~x~0_In1497647242} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:17:48,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:17:48,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In688249210 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In688249210 256)))) (or (and (= ~x$w_buff0_used~0_In688249210 |P2Thread1of1ForFork1_#t~ite34_Out688249210|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out688249210|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688249210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688249210} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out688249210|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688249210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688249210} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:17:48,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2133198130 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2133198130 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out2133198130| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out2133198130| ~x$w_buff0_used~0_In2133198130) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2133198130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133198130} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2133198130, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2133198130|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133198130} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:17:48,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-777326238 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-777326238 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-777326238 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-777326238 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-777326238|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-777326238 |P1Thread1of1ForFork0_#t~ite29_Out-777326238|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-777326238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-777326238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-777326238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-777326238} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-777326238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-777326238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-777326238, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-777326238|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-777326238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:17:48,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1159968654 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-1159968654| |P0Thread1of1ForFork2_#t~ite8_Out-1159968654|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite9_Out-1159968654| ~x$w_buff0~0_In-1159968654)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1159968654| |P0Thread1of1ForFork2_#t~ite8_Out-1159968654|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1159968654 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1159968654 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1159968654 256))) (and (= (mod ~x$r_buff1_thd1~0_In-1159968654 256) 0) .cse1))) (= ~x$w_buff0~0_In-1159968654 |P0Thread1of1ForFork2_#t~ite8_Out-1159968654|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1159968654, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1159968654, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1159968654|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1159968654, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1159968654, ~weak$$choice2~0=~weak$$choice2~0_In-1159968654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1159968654} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1159968654, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1159968654, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1159968654|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1159968654, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1159968654|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1159968654, ~weak$$choice2~0=~weak$$choice2~0_In-1159968654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1159968654} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 18:17:48,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1058980819 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In-1058980819| |P0Thread1of1ForFork2_#t~ite14_Out-1058980819|) (= ~x$w_buff0_used~0_In-1058980819 |P0Thread1of1ForFork2_#t~ite15_Out-1058980819|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-1058980819| |P0Thread1of1ForFork2_#t~ite14_Out-1058980819|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1058980819 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1058980819 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1058980819 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1058980819 256)) .cse1))) (= ~x$w_buff0_used~0_In-1058980819 |P0Thread1of1ForFork2_#t~ite14_Out-1058980819|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1058980819, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1058980819, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1058980819, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1058980819|, ~weak$$choice2~0=~weak$$choice2~0_In-1058980819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1058980819} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1058980819, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1058980819, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1058980819|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1058980819, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1058980819|, ~weak$$choice2~0=~weak$$choice2~0_In-1058980819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1058980819} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:17:48,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1507437113 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out1507437113| ~x$w_buff1_used~0_In1507437113) (= |P0Thread1of1ForFork2_#t~ite17_In1507437113| |P0Thread1of1ForFork2_#t~ite17_Out1507437113|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out1507437113| ~x$w_buff1_used~0_In1507437113) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1507437113 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1507437113 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In1507437113 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1507437113 256)))) (= |P0Thread1of1ForFork2_#t~ite17_Out1507437113| |P0Thread1of1ForFork2_#t~ite18_Out1507437113|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1507437113, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1507437113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1507437113, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1507437113, ~weak$$choice2~0=~weak$$choice2~0_In1507437113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1507437113} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1507437113, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1507437113|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1507437113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1507437113, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1507437113, ~weak$$choice2~0=~weak$$choice2~0_In1507437113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1507437113} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:17:48,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:17:48,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In465262929 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out465262929| ~x$r_buff1_thd1~0_In465262929) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In465262929| |P0Thread1of1ForFork2_#t~ite23_Out465262929|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In465262929 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In465262929 256))) (= 0 (mod ~x$w_buff0_used~0_In465262929 256)) (and (= (mod ~x$w_buff1_used~0_In465262929 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite24_Out465262929| |P0Thread1of1ForFork2_#t~ite23_Out465262929|) (= |P0Thread1of1ForFork2_#t~ite23_Out465262929| ~x$r_buff1_thd1~0_In465262929) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In465262929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In465262929, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In465262929, ~weak$$choice2~0=~weak$$choice2~0_In465262929, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In465262929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465262929} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In465262929, ~x$w_buff1_used~0=~x$w_buff1_used~0_In465262929, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In465262929, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out465262929|, ~weak$$choice2~0=~weak$$choice2~0_In465262929, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out465262929|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465262929} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:17:48,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In891717945 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In891717945 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In891717945 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In891717945 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out891717945|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In891717945 |P2Thread1of1ForFork1_#t~ite35_Out891717945|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In891717945, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In891717945, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In891717945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In891717945} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out891717945|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In891717945, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In891717945, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In891717945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In891717945} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:17:48,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In2126612821 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2126612821 256)))) (or (and (= ~x$r_buff0_thd3~0_In2126612821 |P2Thread1of1ForFork1_#t~ite36_Out2126612821|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out2126612821|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2126612821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126612821} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out2126612821|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2126612821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126612821} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:17:48,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In595026600 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In595026600 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In595026600 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In595026600 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out595026600|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In595026600 |P2Thread1of1ForFork1_#t~ite37_Out595026600|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In595026600, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In595026600, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In595026600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In595026600} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out595026600|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In595026600, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In595026600, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In595026600, ~x$w_buff0_used~0=~x$w_buff0_used~0_In595026600} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:17:48,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:17:48,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In214294010 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In214294010 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out214294010 0)) (and (= ~x$r_buff0_thd2~0_In214294010 ~x$r_buff0_thd2~0_Out214294010) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In214294010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214294010} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out214294010|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out214294010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214294010} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:17:48,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-202337936 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-202337936 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-202337936 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-202337936 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-202337936| ~x$r_buff1_thd2~0_In-202337936)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out-202337936| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-202337936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-202337936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-202337936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-202337936} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-202337936|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-202337936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-202337936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-202337936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-202337936} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:17:48,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:17:48,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:17:48,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:17:48,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In42292026 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In42292026 256)))) (or (and (= ~x$w_buff1~0_In42292026 |ULTIMATE.start_main_#t~ite41_Out42292026|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out42292026| ~x~0_In42292026) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In42292026, ~x$w_buff1_used~0=~x$w_buff1_used~0_In42292026, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In42292026, ~x~0=~x~0_In42292026} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out42292026|, ~x$w_buff1~0=~x$w_buff1~0_In42292026, ~x$w_buff1_used~0=~x$w_buff1_used~0_In42292026, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In42292026, ~x~0=~x~0_In42292026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:17:48,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:17:48,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1144452734 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1144452734 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1144452734| ~x$w_buff0_used~0_In1144452734) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1144452734| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1144452734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1144452734} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1144452734, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1144452734|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1144452734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:17:48,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In605963310 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In605963310 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In605963310 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In605963310 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out605963310| ~x$w_buff1_used~0_In605963310) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out605963310|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In605963310, ~x$w_buff1_used~0=~x$w_buff1_used~0_In605963310, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In605963310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In605963310} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In605963310, ~x$w_buff1_used~0=~x$w_buff1_used~0_In605963310, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In605963310, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out605963310|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In605963310} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:17:48,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In226190428 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In226190428 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out226190428| 0)) (and (= ~x$r_buff0_thd0~0_In226190428 |ULTIMATE.start_main_#t~ite45_Out226190428|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In226190428, ~x$w_buff0_used~0=~x$w_buff0_used~0_In226190428} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In226190428, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out226190428|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In226190428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:17:48,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1068740796 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1068740796 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1068740796 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1068740796 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1068740796| ~x$r_buff1_thd0~0_In-1068740796) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1068740796|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1068740796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1068740796, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1068740796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068740796} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1068740796, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1068740796|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1068740796, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1068740796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068740796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:17:48,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:17:48,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:17:48 BasicIcfg [2019-12-27 18:17:48,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:17:48,760 INFO L168 Benchmark]: Toolchain (without parser) took 182990.65 ms. Allocated memory was 137.4 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 100.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,760 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.95 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 153.5 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.48 ms. Allocated memory is still 201.3 MB. Free memory was 153.5 MB in the beginning and 150.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,762 INFO L168 Benchmark]: Boogie Preprocessor took 42.24 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,763 INFO L168 Benchmark]: RCFGBuilder took 821.49 ms. Allocated memory is still 201.3 MB. Free memory was 147.9 MB in the beginning and 101.4 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,763 INFO L168 Benchmark]: TraceAbstraction took 181322.10 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:17:48,767 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.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.95 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 153.5 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.48 ms. Allocated memory is still 201.3 MB. Free memory was 153.5 MB in the beginning and 150.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.24 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.49 ms. Allocated memory is still 201.3 MB. Free memory was 147.9 MB in the beginning and 101.4 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181322.10 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2064, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2065, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2066, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 181.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2922 SDtfs, 5390 SDslu, 11621 SDs, 0 SdLazy, 7034 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 56 SyntacticMatches, 31 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 107.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 297117 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 63639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...