/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:38:31,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:38:31,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:38:31,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:38:31,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:38:31,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:38:31,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:38:31,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:38:31,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:38:31,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:38:31,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:38:31,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:38:31,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:38:31,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:38:31,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:38:31,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:38:31,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:38:31,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:38:31,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:38:31,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:38:31,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:38:31,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:38:31,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:38:31,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:38:31,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:38:31,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:38:31,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:38:31,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:38:31,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:38:31,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:38:31,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:38:31,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:38:31,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:38:31,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:38:31,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:38:31,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:38:31,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:38:31,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:38:31,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:38:31,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:38:31,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:38:31,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:38:31,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:38:31,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:38:31,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:38:31,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:38:31,586 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:38:31,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:38:31,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:38:31,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:38:31,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:38:31,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:38:31,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:38:31,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:38:31,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:38:31,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:38:31,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:38:31,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:38:31,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:38:31,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:38:31,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:38:31,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:38:31,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:38:31,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:38:31,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:38:31,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:38:31,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:38:31,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:38:31,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:38:31,590 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:38:31,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:38:31,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:38:31,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:38:31,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:38:31,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:38:31,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:38:31,889 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:38:31,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-27 07:38:31,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928fed5c/c58479a34d694d819264226c23e449c2/FLAG9177631d1 [2019-12-27 07:38:32,468 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:38:32,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-27 07:38:32,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928fed5c/c58479a34d694d819264226c23e449c2/FLAG9177631d1 [2019-12-27 07:38:32,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928fed5c/c58479a34d694d819264226c23e449c2 [2019-12-27 07:38:32,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:38:32,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:38:32,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:38:32,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:38:32,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:38:32,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:32" (1/1) ... [2019-12-27 07:38:32,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:32, skipping insertion in model container [2019-12-27 07:38:32,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:32" (1/1) ... [2019-12-27 07:38:32,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:38:32,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:38:33,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:38:33,338 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:38:33,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:38:33,517 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:38:33,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33 WrapperNode [2019-12-27 07:38:33,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:38:33,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:38:33,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:38:33,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:38:33,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:38:33,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:38:33,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:38:33,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:38:33,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (1/1) ... [2019-12-27 07:38:33,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:38:33,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:38:33,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:38:33,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:38:33,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (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 07:38:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:38:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:38:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:38:33,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:38:33,678 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:38:33,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:38:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:38:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:38:33,681 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:38:33,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:38:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:38:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:38:33,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:38:33,684 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 07:38:34,395 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:38:34,395 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:38:34,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:34 BoogieIcfgContainer [2019-12-27 07:38:34,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:38:34,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:38:34,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:38:34,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:38:34,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:38:32" (1/3) ... [2019-12-27 07:38:34,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3910b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:34, skipping insertion in model container [2019-12-27 07:38:34,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:33" (2/3) ... [2019-12-27 07:38:34,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3910b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:34, skipping insertion in model container [2019-12-27 07:38:34,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:34" (3/3) ... [2019-12-27 07:38:34,405 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.oepc.i [2019-12-27 07:38:34,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:38:34,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:38:34,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:38:34,429 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:38:34,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,568 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,568 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,586 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,587 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:38:34,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:38:34,626 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:38:34,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:38:34,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:38:34,627 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:38:34,627 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:38:34,627 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:38:34,627 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:38:34,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:38:34,644 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 07:38:34,646 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:38:34,748 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:38:34,748 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:38:34,767 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:38:34,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:38:34,860 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:38:34,861 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:38:34,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:38:34,888 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:38:34,889 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:38:38,430 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:38:38,583 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:38:38,672 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-27 07:38:38,672 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 07:38:38,676 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 07:38:52,823 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 07:38:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 07:38:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:38:52,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:38:52,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:38:52,832 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 07:38:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:38:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-27 07:38:52,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:38:52,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929427478] [2019-12-27 07:38:52,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:38:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:38:53,165 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 07:38:53,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929427478] [2019-12-27 07:38:53,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:38:53,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:38:53,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839756099] [2019-12-27 07:38:53,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:38:53,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:38:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:38:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:38:53,192 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 07:38:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:38:54,311 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 07:38:54,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:38:54,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:38:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:38:57,454 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 07:38:57,454 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 07:38:57,456 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 07:39:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 07:39:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 07:39:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 07:39:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 07:39:03,433 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 07:39:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:03,433 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 07:39:03,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 07:39:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:39:03,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:03,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:03,443 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 07:39:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-27 07:39:03,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:03,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158097896] [2019-12-27 07:39:03,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:03,551 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 07:39:03,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158097896] [2019-12-27 07:39:03,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:03,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:03,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128072984] [2019-12-27 07:39:03,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:03,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:03,555 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 07:39:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:08,127 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 07:39:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:08,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:39:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:08,590 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 07:39:08,590 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 07:39:08,591 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 07:39:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 07:39:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 07:39:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 07:39:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 07:39:15,444 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 07:39:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:15,445 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 07:39:15,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 07:39:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:39:15,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:15,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:15,449 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 07:39:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-27 07:39:15,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:15,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937099791] [2019-12-27 07:39:15,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:15,551 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 07:39:15,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937099791] [2019-12-27 07:39:15,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:15,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:15,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074389904] [2019-12-27 07:39:15,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:15,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:15,555 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 07:39:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:19,552 INFO L93 Difference]: Finished difference Result 37434 states and 130812 transitions. [2019-12-27 07:39:19,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:39:19,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:39:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:19,635 INFO L225 Difference]: With dead ends: 37434 [2019-12-27 07:39:19,636 INFO L226 Difference]: Without dead ends: 29372 [2019-12-27 07:39:19,636 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 07:39:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-12-27 07:39:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 29300. [2019-12-27 07:39:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29300 states. [2019-12-27 07:39:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29300 states to 29300 states and 98618 transitions. [2019-12-27 07:39:20,276 INFO L78 Accepts]: Start accepts. Automaton has 29300 states and 98618 transitions. Word has length 13 [2019-12-27 07:39:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:20,276 INFO L462 AbstractCegarLoop]: Abstraction has 29300 states and 98618 transitions. [2019-12-27 07:39:20,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29300 states and 98618 transitions. [2019-12-27 07:39:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:20,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:20,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:20,279 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 07:39:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-27 07:39:20,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:20,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769388808] [2019-12-27 07:39:20,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:20,353 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 07:39:20,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769388808] [2019-12-27 07:39:20,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:20,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:20,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577425184] [2019-12-27 07:39:20,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:20,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:20,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:20,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:20,355 INFO L87 Difference]: Start difference. First operand 29300 states and 98618 transitions. Second operand 3 states. [2019-12-27 07:39:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:20,570 INFO L93 Difference]: Finished difference Result 43227 states and 144586 transitions. [2019-12-27 07:39:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:20,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:39:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:20,661 INFO L225 Difference]: With dead ends: 43227 [2019-12-27 07:39:20,662 INFO L226 Difference]: Without dead ends: 43227 [2019-12-27 07:39:20,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43227 states. [2019-12-27 07:39:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43227 to 32227. [2019-12-27 07:39:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-12-27 07:39:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 107573 transitions. [2019-12-27 07:39:21,746 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 107573 transitions. Word has length 14 [2019-12-27 07:39:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:21,747 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 107573 transitions. [2019-12-27 07:39:21,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 107573 transitions. [2019-12-27 07:39:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:21,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:21,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:21,748 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 07:39:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:21,749 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-27 07:39:21,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:21,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961082013] [2019-12-27 07:39:21,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:21,830 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 07:39:21,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961082013] [2019-12-27 07:39:21,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:21,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:21,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928728034] [2019-12-27 07:39:21,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:21,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:21,833 INFO L87 Difference]: Start difference. First operand 32227 states and 107573 transitions. Second operand 4 states. [2019-12-27 07:39:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:22,230 INFO L93 Difference]: Finished difference Result 39628 states and 130327 transitions. [2019-12-27 07:39:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:22,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:39:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:22,329 INFO L225 Difference]: With dead ends: 39628 [2019-12-27 07:39:22,330 INFO L226 Difference]: Without dead ends: 39539 [2019-12-27 07:39:22,330 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 07:39:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39539 states. [2019-12-27 07:39:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39539 to 34645. [2019-12-27 07:39:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34645 states. [2019-12-27 07:39:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34645 states to 34645 states and 115289 transitions. [2019-12-27 07:39:23,008 INFO L78 Accepts]: Start accepts. Automaton has 34645 states and 115289 transitions. Word has length 14 [2019-12-27 07:39:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:23,008 INFO L462 AbstractCegarLoop]: Abstraction has 34645 states and 115289 transitions. [2019-12-27 07:39:23,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34645 states and 115289 transitions. [2019-12-27 07:39:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:39:23,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:23,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:23,010 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 07:39:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-27 07:39:23,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:23,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047699032] [2019-12-27 07:39:23,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:23,091 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 07:39:23,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047699032] [2019-12-27 07:39:23,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:23,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:23,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581361903] [2019-12-27 07:39:23,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:39:23,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:39:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:39:23,093 INFO L87 Difference]: Start difference. First operand 34645 states and 115289 transitions. Second operand 4 states. [2019-12-27 07:39:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:23,426 INFO L93 Difference]: Finished difference Result 41557 states and 136749 transitions. [2019-12-27 07:39:23,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:23,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:39:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:23,500 INFO L225 Difference]: With dead ends: 41557 [2019-12-27 07:39:23,500 INFO L226 Difference]: Without dead ends: 41459 [2019-12-27 07:39:23,500 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 07:39:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41459 states. [2019-12-27 07:39:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41459 to 35260. [2019-12-27 07:39:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35260 states. [2019-12-27 07:39:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35260 states to 35260 states and 117020 transitions. [2019-12-27 07:39:24,386 INFO L78 Accepts]: Start accepts. Automaton has 35260 states and 117020 transitions. Word has length 14 [2019-12-27 07:39:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:24,386 INFO L462 AbstractCegarLoop]: Abstraction has 35260 states and 117020 transitions. [2019-12-27 07:39:24,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:39:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 35260 states and 117020 transitions. [2019-12-27 07:39:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:24,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:24,399 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 07:39:24,399 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 07:39:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-27 07:39:24,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:24,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728323988] [2019-12-27 07:39:24,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:24,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728323988] [2019-12-27 07:39:24,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:24,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:24,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146009587] [2019-12-27 07:39:24,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:24,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:24,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:24,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:24,570 INFO L87 Difference]: Start difference. First operand 35260 states and 117020 transitions. Second operand 5 states. [2019-12-27 07:39:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:25,170 INFO L93 Difference]: Finished difference Result 47518 states and 155149 transitions. [2019-12-27 07:39:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:25,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:39:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:25,251 INFO L225 Difference]: With dead ends: 47518 [2019-12-27 07:39:25,251 INFO L226 Difference]: Without dead ends: 47342 [2019-12-27 07:39:25,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 07:39:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47342 states. [2019-12-27 07:39:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47342 to 35974. [2019-12-27 07:39:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2019-12-27 07:39:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 119384 transitions. [2019-12-27 07:39:25,991 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 119384 transitions. Word has length 22 [2019-12-27 07:39:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:25,992 INFO L462 AbstractCegarLoop]: Abstraction has 35974 states and 119384 transitions. [2019-12-27 07:39:25,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 119384 transitions. [2019-12-27 07:39:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:39:26,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:26,003 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 07:39:26,003 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 07:39:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-27 07:39:26,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:26,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155680609] [2019-12-27 07:39:26,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:26,100 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 07:39:26,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155680609] [2019-12-27 07:39:26,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:26,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:26,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155675358] [2019-12-27 07:39:26,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:26,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:26,102 INFO L87 Difference]: Start difference. First operand 35974 states and 119384 transitions. Second operand 5 states. [2019-12-27 07:39:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:26,881 INFO L93 Difference]: Finished difference Result 47846 states and 156183 transitions. [2019-12-27 07:39:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:39:26,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:39:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:26,974 INFO L225 Difference]: With dead ends: 47846 [2019-12-27 07:39:26,974 INFO L226 Difference]: Without dead ends: 47578 [2019-12-27 07:39:26,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 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 07:39:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47578 states. [2019-12-27 07:39:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47578 to 33984. [2019-12-27 07:39:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2019-12-27 07:39:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 112757 transitions. [2019-12-27 07:39:27,663 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 112757 transitions. Word has length 22 [2019-12-27 07:39:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:27,663 INFO L462 AbstractCegarLoop]: Abstraction has 33984 states and 112757 transitions. [2019-12-27 07:39:27,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 112757 transitions. [2019-12-27 07:39:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:39:27,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:27,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:27,678 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 07:39:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-27 07:39:27,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:27,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581679841] [2019-12-27 07:39:27,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:27,771 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 07:39:27,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581679841] [2019-12-27 07:39:27,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:27,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:39:27,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228309294] [2019-12-27 07:39:27,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:27,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:27,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:27,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:27,774 INFO L87 Difference]: Start difference. First operand 33984 states and 112757 transitions. Second operand 5 states. [2019-12-27 07:39:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:28,284 INFO L93 Difference]: Finished difference Result 46481 states and 151170 transitions. [2019-12-27 07:39:28,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:39:28,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:39:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:28,370 INFO L225 Difference]: With dead ends: 46481 [2019-12-27 07:39:28,370 INFO L226 Difference]: Without dead ends: 46454 [2019-12-27 07:39:28,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46454 states. [2019-12-27 07:39:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46454 to 37630. [2019-12-27 07:39:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37630 states. [2019-12-27 07:39:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37630 states to 37630 states and 124168 transitions. [2019-12-27 07:39:29,477 INFO L78 Accepts]: Start accepts. Automaton has 37630 states and 124168 transitions. Word has length 25 [2019-12-27 07:39:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:29,478 INFO L462 AbstractCegarLoop]: Abstraction has 37630 states and 124168 transitions. [2019-12-27 07:39:29,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37630 states and 124168 transitions. [2019-12-27 07:39:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 07:39:29,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:29,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:29,497 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 07:39:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash 40947621, now seen corresponding path program 1 times [2019-12-27 07:39:29,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:29,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986170600] [2019-12-27 07:39:29,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:29,571 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 07:39:29,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986170600] [2019-12-27 07:39:29,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:29,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:39:29,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882823158] [2019-12-27 07:39:29,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:39:29,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:29,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:39:29,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:39:29,573 INFO L87 Difference]: Start difference. First operand 37630 states and 124168 transitions. Second operand 5 states. [2019-12-27 07:39:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:29,691 INFO L93 Difference]: Finished difference Result 16928 states and 51968 transitions. [2019-12-27 07:39:29,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:39:29,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 07:39:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:29,713 INFO L225 Difference]: With dead ends: 16928 [2019-12-27 07:39:29,714 INFO L226 Difference]: Without dead ends: 14438 [2019-12-27 07:39:29,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14438 states. [2019-12-27 07:39:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14438 to 14106. [2019-12-27 07:39:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14106 states. [2019-12-27 07:39:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14106 states to 14106 states and 42981 transitions. [2019-12-27 07:39:29,927 INFO L78 Accepts]: Start accepts. Automaton has 14106 states and 42981 transitions. Word has length 28 [2019-12-27 07:39:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 14106 states and 42981 transitions. [2019-12-27 07:39:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:39:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14106 states and 42981 transitions. [2019-12-27 07:39:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:39:29,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:29,948 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] [2019-12-27 07:39:29,948 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 07:39:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:29,948 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-27 07:39:29,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:29,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871271862] [2019-12-27 07:39:29,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:29,997 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 07:39:29,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871271862] [2019-12-27 07:39:29,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:29,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:29,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57659536] [2019-12-27 07:39:29,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:29,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:30,000 INFO L87 Difference]: Start difference. First operand 14106 states and 42981 transitions. Second operand 3 states. [2019-12-27 07:39:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:30,123 INFO L93 Difference]: Finished difference Result 25950 states and 78976 transitions. [2019-12-27 07:39:30,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:30,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:39:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:30,154 INFO L225 Difference]: With dead ends: 25950 [2019-12-27 07:39:30,155 INFO L226 Difference]: Without dead ends: 14456 [2019-12-27 07:39:30,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2019-12-27 07:39:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 14298. [2019-12-27 07:39:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14298 states. [2019-12-27 07:39:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14298 states to 14298 states and 42698 transitions. [2019-12-27 07:39:30,486 INFO L78 Accepts]: Start accepts. Automaton has 14298 states and 42698 transitions. Word has length 39 [2019-12-27 07:39:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:30,486 INFO L462 AbstractCegarLoop]: Abstraction has 14298 states and 42698 transitions. [2019-12-27 07:39:30,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14298 states and 42698 transitions. [2019-12-27 07:39:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:39:30,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:30,517 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 07:39:30,517 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 07:39:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-27 07:39:30,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:30,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623538342] [2019-12-27 07:39:30,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:30,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623538342] [2019-12-27 07:39:30,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:30,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:39:30,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066091870] [2019-12-27 07:39:30,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:30,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:30,675 INFO L87 Difference]: Start difference. First operand 14298 states and 42698 transitions. Second operand 6 states. [2019-12-27 07:39:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:30,777 INFO L93 Difference]: Finished difference Result 12948 states and 39291 transitions. [2019-12-27 07:39:30,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:39:30,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 07:39:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:30,795 INFO L225 Difference]: With dead ends: 12948 [2019-12-27 07:39:30,796 INFO L226 Difference]: Without dead ends: 10783 [2019-12-27 07:39:30,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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 07:39:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10783 states. [2019-12-27 07:39:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10783 to 9467. [2019-12-27 07:39:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9467 states. [2019-12-27 07:39:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9467 states to 9467 states and 29555 transitions. [2019-12-27 07:39:30,957 INFO L78 Accepts]: Start accepts. Automaton has 9467 states and 29555 transitions. Word has length 40 [2019-12-27 07:39:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:30,957 INFO L462 AbstractCegarLoop]: Abstraction has 9467 states and 29555 transitions. [2019-12-27 07:39:30,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 9467 states and 29555 transitions. [2019-12-27 07:39:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:30,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:30,972 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] [2019-12-27 07:39:30,972 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 07:39:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-27 07:39:30,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:30,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454031198] [2019-12-27 07:39:30,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:31,086 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 07:39:31,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454031198] [2019-12-27 07:39:31,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:31,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228980736] [2019-12-27 07:39:31,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:31,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:31,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:31,089 INFO L87 Difference]: Start difference. First operand 9467 states and 29555 transitions. Second operand 7 states. [2019-12-27 07:39:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:31,460 INFO L93 Difference]: Finished difference Result 25853 states and 80397 transitions. [2019-12-27 07:39:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:39:31,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:31,490 INFO L225 Difference]: With dead ends: 25853 [2019-12-27 07:39:31,491 INFO L226 Difference]: Without dead ends: 19749 [2019-12-27 07:39:31,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:39:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2019-12-27 07:39:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 11483. [2019-12-27 07:39:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11483 states. [2019-12-27 07:39:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 36134 transitions. [2019-12-27 07:39:31,732 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 36134 transitions. Word has length 54 [2019-12-27 07:39:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:31,732 INFO L462 AbstractCegarLoop]: Abstraction has 11483 states and 36134 transitions. [2019-12-27 07:39:31,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 36134 transitions. [2019-12-27 07:39:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:31,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:31,746 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] [2019-12-27 07:39:31,746 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 07:39:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-27 07:39:31,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:31,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734793604] [2019-12-27 07:39:31,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:31,836 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 07:39:31,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734793604] [2019-12-27 07:39:31,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:31,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:31,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291783375] [2019-12-27 07:39:31,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:31,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:31,838 INFO L87 Difference]: Start difference. First operand 11483 states and 36134 transitions. Second operand 7 states. [2019-12-27 07:39:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:32,352 INFO L93 Difference]: Finished difference Result 32418 states and 99744 transitions. [2019-12-27 07:39:32,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:39:32,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:32,387 INFO L225 Difference]: With dead ends: 32418 [2019-12-27 07:39:32,387 INFO L226 Difference]: Without dead ends: 22978 [2019-12-27 07:39:32,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:39:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22978 states. [2019-12-27 07:39:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22978 to 14415. [2019-12-27 07:39:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-12-27 07:39:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 45368 transitions. [2019-12-27 07:39:32,683 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 45368 transitions. Word has length 54 [2019-12-27 07:39:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:32,684 INFO L462 AbstractCegarLoop]: Abstraction has 14415 states and 45368 transitions. [2019-12-27 07:39:32,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 45368 transitions. [2019-12-27 07:39:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:32,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:32,702 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] [2019-12-27 07:39:32,702 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 07:39:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-27 07:39:32,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:32,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559807658] [2019-12-27 07:39:32,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:32,804 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 07:39:32,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559807658] [2019-12-27 07:39:32,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:32,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:39:32,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560604082] [2019-12-27 07:39:32,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:39:32,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:39:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:39:32,806 INFO L87 Difference]: Start difference. First operand 14415 states and 45368 transitions. Second operand 8 states. [2019-12-27 07:39:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:33,731 INFO L93 Difference]: Finished difference Result 35579 states and 108354 transitions. [2019-12-27 07:39:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:39:33,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 07:39:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:33,777 INFO L225 Difference]: With dead ends: 35579 [2019-12-27 07:39:33,777 INFO L226 Difference]: Without dead ends: 33133 [2019-12-27 07:39:33,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:39:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33133 states. [2019-12-27 07:39:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33133 to 14473. [2019-12-27 07:39:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14473 states. [2019-12-27 07:39:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14473 states to 14473 states and 45640 transitions. [2019-12-27 07:39:34,136 INFO L78 Accepts]: Start accepts. Automaton has 14473 states and 45640 transitions. Word has length 54 [2019-12-27 07:39:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:34,136 INFO L462 AbstractCegarLoop]: Abstraction has 14473 states and 45640 transitions. [2019-12-27 07:39:34,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:39:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14473 states and 45640 transitions. [2019-12-27 07:39:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:34,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:34,154 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] [2019-12-27 07:39:34,154 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 07:39:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1940623004, now seen corresponding path program 4 times [2019-12-27 07:39:34,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:34,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575990407] [2019-12-27 07:39:34,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:34,263 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 07:39:34,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575990407] [2019-12-27 07:39:34,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:34,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:34,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520986061] [2019-12-27 07:39:34,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:34,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:34,265 INFO L87 Difference]: Start difference. First operand 14473 states and 45640 transitions. Second operand 9 states. [2019-12-27 07:39:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:35,536 INFO L93 Difference]: Finished difference Result 49504 states and 150336 transitions. [2019-12-27 07:39:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 07:39:35,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:39:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:35,606 INFO L225 Difference]: With dead ends: 49504 [2019-12-27 07:39:35,606 INFO L226 Difference]: Without dead ends: 47058 [2019-12-27 07:39:35,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:39:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47058 states. [2019-12-27 07:39:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47058 to 14494. [2019-12-27 07:39:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14494 states. [2019-12-27 07:39:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 45720 transitions. [2019-12-27 07:39:36,253 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 45720 transitions. Word has length 54 [2019-12-27 07:39:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:36,253 INFO L462 AbstractCegarLoop]: Abstraction has 14494 states and 45720 transitions. [2019-12-27 07:39:36,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 45720 transitions. [2019-12-27 07:39:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:36,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:36,272 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] [2019-12-27 07:39:36,273 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 07:39:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1600716830, now seen corresponding path program 5 times [2019-12-27 07:39:36,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:36,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112995694] [2019-12-27 07:39:36,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:36,386 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 07:39:36,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112995694] [2019-12-27 07:39:36,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:36,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:39:36,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589537019] [2019-12-27 07:39:36,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:39:36,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:39:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:39:36,389 INFO L87 Difference]: Start difference. First operand 14494 states and 45720 transitions. Second operand 9 states. [2019-12-27 07:39:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:37,864 INFO L93 Difference]: Finished difference Result 63652 states and 193236 transitions. [2019-12-27 07:39:37,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 07:39:37,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 07:39:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:37,945 INFO L225 Difference]: With dead ends: 63652 [2019-12-27 07:39:37,946 INFO L226 Difference]: Without dead ends: 54968 [2019-12-27 07:39:37,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 07:39:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54968 states. [2019-12-27 07:39:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54968 to 18583. [2019-12-27 07:39:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18583 states. [2019-12-27 07:39:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18583 states to 18583 states and 58671 transitions. [2019-12-27 07:39:38,555 INFO L78 Accepts]: Start accepts. Automaton has 18583 states and 58671 transitions. Word has length 54 [2019-12-27 07:39:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:38,555 INFO L462 AbstractCegarLoop]: Abstraction has 18583 states and 58671 transitions. [2019-12-27 07:39:38,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:39:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18583 states and 58671 transitions. [2019-12-27 07:39:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:38,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:38,579 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] [2019-12-27 07:39:38,579 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 07:39:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 6 times [2019-12-27 07:39:38,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:38,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150532513] [2019-12-27 07:39:38,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:39:38,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150532513] [2019-12-27 07:39:38,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:38,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:39:38,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924085674] [2019-12-27 07:39:38,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:39:38,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:39:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:39:38,686 INFO L87 Difference]: Start difference. First operand 18583 states and 58671 transitions. Second operand 7 states. [2019-12-27 07:39:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:39,763 INFO L93 Difference]: Finished difference Result 36231 states and 111529 transitions. [2019-12-27 07:39:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:39:39,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 07:39:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:39,818 INFO L225 Difference]: With dead ends: 36231 [2019-12-27 07:39:39,818 INFO L226 Difference]: Without dead ends: 36147 [2019-12-27 07:39:39,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:39:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36147 states. [2019-12-27 07:39:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36147 to 21319. [2019-12-27 07:39:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21319 states. [2019-12-27 07:39:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21319 states to 21319 states and 66755 transitions. [2019-12-27 07:39:40,530 INFO L78 Accepts]: Start accepts. Automaton has 21319 states and 66755 transitions. Word has length 54 [2019-12-27 07:39:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:40,530 INFO L462 AbstractCegarLoop]: Abstraction has 21319 states and 66755 transitions. [2019-12-27 07:39:40,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:39:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21319 states and 66755 transitions. [2019-12-27 07:39:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:40,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:40,555 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] [2019-12-27 07:39:40,555 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 07:39:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 7 times [2019-12-27 07:39:40,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:40,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595312748] [2019-12-27 07:39:40,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:40,653 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 07:39:40,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595312748] [2019-12-27 07:39:40,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:40,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:39:40,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185478251] [2019-12-27 07:39:40,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:39:40,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:39:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:39:40,655 INFO L87 Difference]: Start difference. First operand 21319 states and 66755 transitions. Second operand 6 states. [2019-12-27 07:39:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:41,450 INFO L93 Difference]: Finished difference Result 32118 states and 97686 transitions. [2019-12-27 07:39:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:39:41,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 07:39:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:41,514 INFO L225 Difference]: With dead ends: 32118 [2019-12-27 07:39:41,514 INFO L226 Difference]: Without dead ends: 31996 [2019-12-27 07:39:41,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:39:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31996 states. [2019-12-27 07:39:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31996 to 26591. [2019-12-27 07:39:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26591 states. [2019-12-27 07:39:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26591 states to 26591 states and 82479 transitions. [2019-12-27 07:39:41,982 INFO L78 Accepts]: Start accepts. Automaton has 26591 states and 82479 transitions. Word has length 54 [2019-12-27 07:39:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:41,983 INFO L462 AbstractCegarLoop]: Abstraction has 26591 states and 82479 transitions. [2019-12-27 07:39:41,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:39:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26591 states and 82479 transitions. [2019-12-27 07:39:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:39:42,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:42,015 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] [2019-12-27 07:39:42,015 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 07:39:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 8 times [2019-12-27 07:39:42,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:42,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641065227] [2019-12-27 07:39:42,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:42,077 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 07:39:42,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641065227] [2019-12-27 07:39:42,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:42,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:42,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641941469] [2019-12-27 07:39:42,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:42,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:42,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:42,079 INFO L87 Difference]: Start difference. First operand 26591 states and 82479 transitions. Second operand 3 states. [2019-12-27 07:39:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:42,196 INFO L93 Difference]: Finished difference Result 26589 states and 82474 transitions. [2019-12-27 07:39:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:42,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 07:39:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:42,252 INFO L225 Difference]: With dead ends: 26589 [2019-12-27 07:39:42,253 INFO L226 Difference]: Without dead ends: 26589 [2019-12-27 07:39:42,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26589 states. [2019-12-27 07:39:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26589 to 22408. [2019-12-27 07:39:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22408 states. [2019-12-27 07:39:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22408 states to 22408 states and 70952 transitions. [2019-12-27 07:39:42,966 INFO L78 Accepts]: Start accepts. Automaton has 22408 states and 70952 transitions. Word has length 54 [2019-12-27 07:39:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:42,967 INFO L462 AbstractCegarLoop]: Abstraction has 22408 states and 70952 transitions. [2019-12-27 07:39:42,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 22408 states and 70952 transitions. [2019-12-27 07:39:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:39:43,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:43,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:39:43,014 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 07:39:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1045193736, now seen corresponding path program 1 times [2019-12-27 07:39:43,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:43,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013881039] [2019-12-27 07:39:43,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:43,125 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 07:39:43,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013881039] [2019-12-27 07:39:43,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:43,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:39:43,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452021918] [2019-12-27 07:39:43,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:39:43,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:39:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:43,128 INFO L87 Difference]: Start difference. First operand 22408 states and 70952 transitions. Second operand 3 states. [2019-12-27 07:39:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:43,218 INFO L93 Difference]: Finished difference Result 17531 states and 54465 transitions. [2019-12-27 07:39:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:39:43,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:39:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:43,254 INFO L225 Difference]: With dead ends: 17531 [2019-12-27 07:39:43,254 INFO L226 Difference]: Without dead ends: 17531 [2019-12-27 07:39:43,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:39:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17531 states. [2019-12-27 07:39:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17531 to 16654. [2019-12-27 07:39:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16654 states. [2019-12-27 07:39:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16654 states to 16654 states and 51716 transitions. [2019-12-27 07:39:43,566 INFO L78 Accepts]: Start accepts. Automaton has 16654 states and 51716 transitions. Word has length 55 [2019-12-27 07:39:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:43,566 INFO L462 AbstractCegarLoop]: Abstraction has 16654 states and 51716 transitions. [2019-12-27 07:39:43,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:39:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 16654 states and 51716 transitions. [2019-12-27 07:39:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:43,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:43,584 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 07:39:43,585 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-27 07:39:43,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:43,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309592508] [2019-12-27 07:39:43,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:43,764 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 07:39:43,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309592508] [2019-12-27 07:39:43,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:43,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:39:43,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825315555] [2019-12-27 07:39:43,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:39:43,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:43,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:39:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:39:43,766 INFO L87 Difference]: Start difference. First operand 16654 states and 51716 transitions. Second operand 11 states. [2019-12-27 07:39:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:44,961 INFO L93 Difference]: Finished difference Result 35393 states and 108950 transitions. [2019-12-27 07:39:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:39:44,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 07:39:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:45,000 INFO L225 Difference]: With dead ends: 35393 [2019-12-27 07:39:45,000 INFO L226 Difference]: Without dead ends: 26067 [2019-12-27 07:39:45,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 07:39:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26067 states. [2019-12-27 07:39:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26067 to 16817. [2019-12-27 07:39:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16817 states. [2019-12-27 07:39:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 51672 transitions. [2019-12-27 07:39:45,313 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 51672 transitions. Word has length 56 [2019-12-27 07:39:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:45,313 INFO L462 AbstractCegarLoop]: Abstraction has 16817 states and 51672 transitions. [2019-12-27 07:39:45,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:39:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 51672 transitions. [2019-12-27 07:39:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:45,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:45,332 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 07:39:45,332 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028998, now seen corresponding path program 2 times [2019-12-27 07:39:45,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:45,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943896801] [2019-12-27 07:39:45,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:39:45,512 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 07:39:45,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943896801] [2019-12-27 07:39:45,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:39:45,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:39:45,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445380639] [2019-12-27 07:39:45,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:39:45,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:39:45,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:39:45,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:39:45,514 INFO L87 Difference]: Start difference. First operand 16817 states and 51672 transitions. Second operand 12 states. [2019-12-27 07:39:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:39:46,413 INFO L93 Difference]: Finished difference Result 26452 states and 80733 transitions. [2019-12-27 07:39:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:39:46,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 07:39:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:39:46,452 INFO L225 Difference]: With dead ends: 26452 [2019-12-27 07:39:46,452 INFO L226 Difference]: Without dead ends: 25877 [2019-12-27 07:39:46,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:39:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25877 states. [2019-12-27 07:39:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25877 to 16499. [2019-12-27 07:39:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16499 states. [2019-12-27 07:39:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16499 states to 16499 states and 50808 transitions. [2019-12-27 07:39:46,764 INFO L78 Accepts]: Start accepts. Automaton has 16499 states and 50808 transitions. Word has length 56 [2019-12-27 07:39:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:39:46,764 INFO L462 AbstractCegarLoop]: Abstraction has 16499 states and 50808 transitions. [2019-12-27 07:39:46,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:39:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 16499 states and 50808 transitions. [2019-12-27 07:39:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:39:46,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:39:46,782 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 07:39:46,782 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:39:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:39:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 3 times [2019-12-27 07:39:46,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:39:46,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682915247] [2019-12-27 07:39:46,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:39:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:39:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:39:46,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:39:46,888 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:39:46,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_22|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_22|) |v_ULTIMATE.start_main_~#t2079~0.offset_18| 0))) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_22|) 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_22| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_22| 4) |v_#length_23|) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_~#t2079~0.offset_18| 0) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_18|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_18|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:39:46,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) 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_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-27 07:39:46,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} 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 07:39:46,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:39:46,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In583591888 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In583591888 256)))) (or (and (= ~x$w_buff1~0_In583591888 |P2Thread1of1ForFork1_#t~ite32_Out583591888|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In583591888 |P2Thread1of1ForFork1_#t~ite32_Out583591888|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In583591888, ~x$w_buff1_used~0=~x$w_buff1_used~0_In583591888, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In583591888, ~x~0=~x~0_In583591888} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out583591888|, ~x$w_buff1~0=~x$w_buff1~0_In583591888, ~x$w_buff1_used~0=~x$w_buff1_used~0_In583591888, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In583591888, ~x~0=~x~0_In583591888} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:39:46,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:39:46,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In745011690 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In745011690 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out745011690| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In745011690 |P2Thread1of1ForFork1_#t~ite34_Out745011690|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745011690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745011690} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out745011690|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In745011690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In745011690} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:39:46,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1505496725 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1505496725 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1505496725|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1505496725 |P1Thread1of1ForFork0_#t~ite28_Out1505496725|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1505496725, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1505496725} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1505496725, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1505496725|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1505496725} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:39:46,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In532062056 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In532062056 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In532062056 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In532062056 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out532062056| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out532062056| ~x$w_buff1_used~0_In532062056) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In532062056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In532062056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In532062056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532062056} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In532062056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In532062056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In532062056, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out532062056|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532062056} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:39:46,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2107465707 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In2107465707 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out2107465707 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out2107465707 ~x$r_buff0_thd2~0_In2107465707)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2107465707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2107465707} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2107465707|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2107465707, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2107465707} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:39:46,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-269624722 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-269624722 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-269624722 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-269624722 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-269624722| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-269624722| ~x$r_buff1_thd2~0_In-269624722)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-269624722, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-269624722, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-269624722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-269624722} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-269624722|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-269624722, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-269624722, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-269624722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-269624722} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:39:46,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 07:39:46,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1969219412 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In1969219412| |P0Thread1of1ForFork2_#t~ite8_Out1969219412|) (= ~x$w_buff0~0_In1969219412 |P0Thread1of1ForFork2_#t~ite9_Out1969219412|)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1969219412| ~x$w_buff0~0_In1969219412) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1969219412 256)))) (or (= (mod ~x$w_buff0_used~0_In1969219412 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1969219412 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In1969219412 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite8_Out1969219412| |P0Thread1of1ForFork2_#t~ite9_Out1969219412|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1969219412, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1969219412, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1969219412|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1969219412, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1969219412, ~weak$$choice2~0=~weak$$choice2~0_In1969219412, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1969219412} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1969219412, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1969219412, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1969219412|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1969219412, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1969219412|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1969219412, ~weak$$choice2~0=~weak$$choice2~0_In1969219412, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1969219412} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:39:46,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-219617483 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-219617483 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-219617483 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-219617483 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-219617483 |P2Thread1of1ForFork1_#t~ite35_Out-219617483|)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-219617483| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-219617483, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-219617483, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-219617483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-219617483} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-219617483|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219617483, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-219617483, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-219617483, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-219617483} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:39:46,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1535573481 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1535573481 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1535573481 |P2Thread1of1ForFork1_#t~ite36_Out-1535573481|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1535573481|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1535573481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1535573481} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1535573481|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1535573481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1535573481} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:39:46,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1896915338 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1896915338 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1896915338 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1896915338 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1896915338| ~x$r_buff1_thd3~0_In-1896915338) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1896915338| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1896915338, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1896915338, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1896915338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1896915338} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1896915338|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1896915338, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1896915338, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1896915338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1896915338} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:39:46,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, 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 07:39:46,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In95734126 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In95734126| |P0Thread1of1ForFork2_#t~ite17_Out95734126|) (= ~x$w_buff1_used~0_In95734126 |P0Thread1of1ForFork2_#t~ite18_Out95734126|)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In95734126 256)))) (or (= (mod ~x$w_buff0_used~0_In95734126 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In95734126 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In95734126 256) 0) .cse1))) (= ~x$w_buff1_used~0_In95734126 |P0Thread1of1ForFork2_#t~ite17_Out95734126|) (= |P0Thread1of1ForFork2_#t~ite18_Out95734126| |P0Thread1of1ForFork2_#t~ite17_Out95734126|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In95734126, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In95734126|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In95734126, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In95734126, ~weak$$choice2~0=~weak$$choice2~0_In95734126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In95734126} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In95734126, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out95734126|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out95734126|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In95734126, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In95734126, ~weak$$choice2~0=~weak$$choice2~0_In95734126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In95734126} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:39:46,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} 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 07:39:46,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse2 (= |P0Thread1of1ForFork2_#t~ite24_Out518923399| |P0Thread1of1ForFork2_#t~ite23_Out518923399|)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In518923399 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In518923399 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In518923399 256))) (.cse5 (= (mod ~x$w_buff0_used~0_In518923399 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In518923399 256) 0))) (or (let ((.cse1 (not .cse6))) (and (= 0 |P0Thread1of1ForFork2_#t~ite22_Out518923399|) (or (not .cse0) .cse1) .cse2 (or (not .cse3) .cse1) .cse4 (not .cse5) (= |P0Thread1of1ForFork2_#t~ite23_Out518923399| |P0Thread1of1ForFork2_#t~ite22_Out518923399|))) (and (= |P0Thread1of1ForFork2_#t~ite22_In518923399| |P0Thread1of1ForFork2_#t~ite22_Out518923399|) (or (and .cse2 .cse4 (or (and .cse6 .cse3) (and .cse6 .cse0) .cse5) (= ~x$r_buff1_thd1~0_In518923399 |P0Thread1of1ForFork2_#t~ite23_Out518923399|)) (and (= ~x$r_buff1_thd1~0_In518923399 |P0Thread1of1ForFork2_#t~ite24_Out518923399|) (not .cse4) (= |P0Thread1of1ForFork2_#t~ite23_In518923399| |P0Thread1of1ForFork2_#t~ite23_Out518923399|)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In518923399, ~x$w_buff1_used~0=~x$w_buff1_used~0_In518923399, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In518923399, ~weak$$choice2~0=~weak$$choice2~0_In518923399, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In518923399|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In518923399|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In518923399} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In518923399, ~x$w_buff1_used~0=~x$w_buff1_used~0_In518923399, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In518923399, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out518923399|, ~weak$$choice2~0=~weak$$choice2~0_In518923399, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out518923399|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out518923399|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In518923399} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:39:46,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:39:46,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:39:46,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In957112704 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In957112704 256) 0))) (or (and (= ~x~0_In957112704 |ULTIMATE.start_main_#t~ite41_Out957112704|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out957112704| ~x$w_buff1~0_In957112704) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In957112704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In957112704, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In957112704, ~x~0=~x~0_In957112704} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out957112704|, ~x$w_buff1~0=~x$w_buff1~0_In957112704, ~x$w_buff1_used~0=~x$w_buff1_used~0_In957112704, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In957112704, ~x~0=~x~0_In957112704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:39:46,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:39:46,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1146823276 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1146823276 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1146823276| ~x$w_buff0_used~0_In1146823276)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out1146823276|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1146823276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1146823276} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1146823276, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1146823276|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1146823276} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:39:46,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1109713131 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1109713131 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1109713131 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1109713131 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-1109713131| ~x$w_buff1_used~0_In-1109713131)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite44_Out-1109713131| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1109713131, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1109713131, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1109713131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1109713131} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1109713131, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1109713131, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1109713131, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1109713131|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1109713131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:39:46,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1136007049 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1136007049 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1136007049| ~x$r_buff0_thd0~0_In1136007049)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1136007049|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1136007049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136007049} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1136007049, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1136007049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136007049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:39:46,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1704822040 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1704822040 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1704822040 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1704822040 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1704822040| ~x$r_buff1_thd0~0_In1704822040) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out1704822040| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1704822040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704822040, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1704822040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704822040} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1704822040, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1704822040|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704822040, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1704822040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704822040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:39:46,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, 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 07:39:47,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:39:47 BasicIcfg [2019-12-27 07:39:47,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:39:47,004 INFO L168 Benchmark]: Toolchain (without parser) took 74226.99 ms. Allocated memory was 138.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,004 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.81 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.65 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,009 INFO L168 Benchmark]: Boogie Preprocessor took 38.34 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,009 INFO L168 Benchmark]: RCFGBuilder took 781.51 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 105.3 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,010 INFO L168 Benchmark]: TraceAbstraction took 72604.26 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:39:47,016 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.81 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.3 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.65 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.34 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.51 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 105.3 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72604.26 ms. Allocated memory was 203.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 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(&t2079, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2080, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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_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(&t2081, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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_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) [L730] 1 z = 2 [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=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=1, 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=2] [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=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=1, 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=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [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=1, __unbuffered_p0_EAX=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=2] [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)) [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 [L742] EXPR 1 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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_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))=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [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)) [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_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=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=2] [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, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4838 SDtfs, 7268 SDslu, 15325 SDs, 0 SdLazy, 6488 SolverSat, 364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 39 SyntacticMatches, 18 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 219389 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 135343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...