/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:29:31,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:29:31,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:29:31,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:29:31,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:29:31,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:29:31,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:29:31,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:29:31,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:29:31,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:29:31,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:29:31,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:29:31,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:29:31,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:29:31,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:29:31,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:29:31,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:29:31,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:29:31,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:29:31,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:29:31,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:29:31,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:29:31,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:29:31,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:29:31,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:29:31,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:29:31,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:29:31,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:29:31,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:29:31,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:29:31,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:29:31,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:29:31,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:29:31,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:29:31,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:29:31,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:29:31,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:29:31,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:29:31,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:29:31,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:29:31,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:29:31,746 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-NoLbe.epf [2019-12-19 05:29:31,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:29:31,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:29:31,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:29:31,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:29:31,762 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:29:31,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:29:31,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:29:31,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:29:31,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:29:31,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:29:31,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:29:31,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:29:31,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:29:31,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:29:31,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:29:31,764 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:29:31,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:29:31,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:29:31,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:29:31,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:29:31,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:29:31,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:29:31,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:29:31,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:29:31,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:29:31,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:29:31,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:29:31,767 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:29:31,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:29:31,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:29:32,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:29:32,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:29:32,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:29:32,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:29:32,068 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:29:32,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-19 05:29:32,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cec6f83e/db14866b882947088a98b634a6c5739a/FLAG758ec1856 [2019-12-19 05:29:32,640 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:29:32,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-19 05:29:32,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cec6f83e/db14866b882947088a98b634a6c5739a/FLAG758ec1856 [2019-12-19 05:29:32,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cec6f83e/db14866b882947088a98b634a6c5739a [2019-12-19 05:29:32,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:29:32,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:29:32,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:29:32,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:29:32,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:29:32,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:29:32" (1/1) ... [2019-12-19 05:29:32,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:32, skipping insertion in model container [2019-12-19 05:29:32,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:29:32" (1/1) ... [2019-12-19 05:29:32,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:29:33,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:29:33,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:29:33,575 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:29:33,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:29:33,739 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:29:33,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33 WrapperNode [2019-12-19 05:29:33,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:29:33,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:29:33,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:29:33,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:29:33,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:29:33,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:29:33,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:29:33,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:29:33,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (1/1) ... [2019-12-19 05:29:33,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:29:33,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:29:33,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:29:33,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:29:33,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29: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-19 05:29:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:29:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:29:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:29:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:29:33,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:29:33,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:29:33,916 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:29:33,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:29:33,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:29:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:29:33,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:29:33,919 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 05:29:34,590 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:29:34,591 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:29:34,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:29:34 BoogieIcfgContainer [2019-12-19 05:29:34,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:29:34,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:29:34,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:29:34,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:29:34,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:29:32" (1/3) ... [2019-12-19 05:29:34,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bc1a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:29:34, skipping insertion in model container [2019-12-19 05:29:34,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:29:33" (2/3) ... [2019-12-19 05:29:34,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bc1a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:29:34, skipping insertion in model container [2019-12-19 05:29:34,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:29:34" (3/3) ... [2019-12-19 05:29:34,606 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc.i [2019-12-19 05:29:34,617 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:29:34,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:29:34,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:29:34,630 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:29:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:29:34,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:29:34,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:29:34,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:29:34,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:29:34,793 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:29:34,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:29:34,794 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:29:34,794 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:29:34,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:29:34,808 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 162 transitions [2019-12-19 05:29:36,439 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-12-19 05:29:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-12-19 05:29:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-19 05:29:36,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:36,452 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] [2019-12-19 05:29:36,453 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash 310103372, now seen corresponding path program 1 times [2019-12-19 05:29:36,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:36,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357351495] [2019-12-19 05:29:36,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:36,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-19 05:29:36,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357351495] [2019-12-19 05:29:36,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:36,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:29:36,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311481659] [2019-12-19 05:29:36,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:29:36,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:36,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:29:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:29:36,828 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-12-19 05:29:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:38,322 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-12-19 05:29:38,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:29:38,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-19 05:29:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:38,531 INFO L225 Difference]: With dead ends: 26614 [2019-12-19 05:29:38,531 INFO L226 Difference]: Without dead ends: 20358 [2019-12-19 05:29:38,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:29:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-12-19 05:29:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-12-19 05:29:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-12-19 05:29:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-12-19 05:29:39,578 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-12-19 05:29:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:39,580 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-12-19 05:29:39,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:29:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-12-19 05:29:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 05:29:39,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:39,594 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] [2019-12-19 05:29:39,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2127220543, now seen corresponding path program 1 times [2019-12-19 05:29:39,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:39,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14370277] [2019-12-19 05:29:39,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:39,758 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-19 05:29:39,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14370277] [2019-12-19 05:29:39,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:39,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:29:39,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553991771] [2019-12-19 05:29:39,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:29:39,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:29:39,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:29:39,764 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-12-19 05:29:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:40,837 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-12-19 05:29:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:29:40,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 05:29:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:40,984 INFO L225 Difference]: With dead ends: 31836 [2019-12-19 05:29:40,984 INFO L226 Difference]: Without dead ends: 31284 [2019-12-19 05:29:40,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:29:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-12-19 05:29:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-12-19 05:29:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-12-19 05:29:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-12-19 05:29:42,988 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-12-19 05:29:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:42,990 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-12-19 05:29:42,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:29:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-12-19 05:29:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 05:29:42,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:42,995 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] [2019-12-19 05:29:42,996 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash -370499147, now seen corresponding path program 1 times [2019-12-19 05:29:42,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:42,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645527547] [2019-12-19 05:29:42,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:43,087 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-19 05:29:43,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645527547] [2019-12-19 05:29:43,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:43,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:29:43,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701768370] [2019-12-19 05:29:43,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:29:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:29:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:29:43,091 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-12-19 05:29:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:43,839 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-12-19 05:29:43,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:29:43,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 05:29:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:44,026 INFO L225 Difference]: With dead ends: 38694 [2019-12-19 05:29:44,026 INFO L226 Difference]: Without dead ends: 38246 [2019-12-19 05:29:44,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:29:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-12-19 05:29:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-12-19 05:29:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-12-19 05:29:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-12-19 05:29:46,437 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-12-19 05:29:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:46,437 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-12-19 05:29:46,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:29:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-12-19 05:29:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 05:29:46,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:46,445 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] [2019-12-19 05:29:46,445 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1101725263, now seen corresponding path program 1 times [2019-12-19 05:29:46,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:46,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783148618] [2019-12-19 05:29:46,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:46,489 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-19 05:29:46,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783148618] [2019-12-19 05:29:46,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:46,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:29:46,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950560231] [2019-12-19 05:29:46,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:29:46,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:46,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:29:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:29:46,491 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-12-19 05:29:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:46,736 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-12-19 05:29:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:29:46,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-19 05:29:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:46,863 INFO L225 Difference]: With dead ends: 42410 [2019-12-19 05:29:46,863 INFO L226 Difference]: Without dead ends: 42410 [2019-12-19 05:29:46,864 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-19 05:29:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-12-19 05:29:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-12-19 05:29:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-12-19 05:29:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-12-19 05:29:50,099 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-12-19 05:29:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:50,100 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-12-19 05:29:50,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:29:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-12-19 05:29:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 05:29:50,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:50,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:29:50,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:50,118 INFO L82 PathProgramCache]: Analyzing trace with hash -929169210, now seen corresponding path program 1 times [2019-12-19 05:29:50,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:50,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505395069] [2019-12-19 05:29:50,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:50,207 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-19 05:29:50,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505395069] [2019-12-19 05:29:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:50,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:29:50,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66224388] [2019-12-19 05:29:50,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:29:50,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:29:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:29:50,209 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 6 states. [2019-12-19 05:29:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:50,908 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-12-19 05:29:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:29:50,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 05:29:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:51,009 INFO L225 Difference]: With dead ends: 48754 [2019-12-19 05:29:51,010 INFO L226 Difference]: Without dead ends: 48234 [2019-12-19 05:29:51,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 05:29:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-12-19 05:29:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-12-19 05:29:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-12-19 05:29:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-12-19 05:29:52,034 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-12-19 05:29:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:52,035 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-12-19 05:29:52,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:29:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-12-19 05:29:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 05:29:52,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:52,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:29:52,051 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2144383564, now seen corresponding path program 1 times [2019-12-19 05:29:52,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:52,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613126614] [2019-12-19 05:29:52,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:52,182 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-19 05:29:52,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613126614] [2019-12-19 05:29:52,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:52,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:29:52,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576432485] [2019-12-19 05:29:52,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:29:52,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:29:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:29:52,186 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-12-19 05:29:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:52,950 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-12-19 05:29:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:29:52,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 05:29:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:53,064 INFO L225 Difference]: With dead ends: 53003 [2019-12-19 05:29:53,064 INFO L226 Difference]: Without dead ends: 52027 [2019-12-19 05:29:53,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:29:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-12-19 05:29:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-12-19 05:29:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-12-19 05:29:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-12-19 05:29:54,371 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-12-19 05:29:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:54,372 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-12-19 05:29:54,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:29:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-12-19 05:29:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 05:29:54,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:54,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:29:54,391 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 347432205, now seen corresponding path program 1 times [2019-12-19 05:29:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:54,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797425002] [2019-12-19 05:29:54,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:54,501 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-19 05:29:54,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797425002] [2019-12-19 05:29:54,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:54,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:29:54,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854020111] [2019-12-19 05:29:54,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:29:54,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:29:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:29:54,505 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-12-19 05:29:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:57,032 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-12-19 05:29:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:29:57,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-19 05:29:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:57,182 INFO L225 Difference]: With dead ends: 70895 [2019-12-19 05:29:57,183 INFO L226 Difference]: Without dead ends: 70895 [2019-12-19 05:29:57,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:29:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-12-19 05:29:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-12-19 05:29:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-19 05:29:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-12-19 05:29:58,509 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-12-19 05:29:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:29:58,510 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-12-19 05:29:58,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:29:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-12-19 05:29:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 05:29:58,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:29:58,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:29:58,524 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:29:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:29:58,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1234935886, now seen corresponding path program 1 times [2019-12-19 05:29:58,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:29:58,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601995940] [2019-12-19 05:29:58,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:29:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:29:58,574 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-19 05:29:58,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601995940] [2019-12-19 05:29:58,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:29:58,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:29:58,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816454530] [2019-12-19 05:29:58,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:29:58,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:29:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:29:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:29:58,576 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 3 states. [2019-12-19 05:29:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:29:58,840 INFO L93 Difference]: Finished difference Result 43854 states and 152831 transitions. [2019-12-19 05:29:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:29:58,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-19 05:29:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:29:58,986 INFO L225 Difference]: With dead ends: 43854 [2019-12-19 05:29:58,987 INFO L226 Difference]: Without dead ends: 43350 [2019-12-19 05:29:58,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:29:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43350 states. [2019-12-19 05:30:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43350 to 41884. [2019-12-19 05:30:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41884 states. [2019-12-19 05:30:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41884 states to 41884 states and 146702 transitions. [2019-12-19 05:30:00,314 INFO L78 Accepts]: Start accepts. Automaton has 41884 states and 146702 transitions. Word has length 52 [2019-12-19 05:30:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:00,315 INFO L462 AbstractCegarLoop]: Abstraction has 41884 states and 146702 transitions. [2019-12-19 05:30:00,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:30:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 41884 states and 146702 transitions. [2019-12-19 05:30:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 05:30:00,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:00,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:00,326 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 696034008, now seen corresponding path program 1 times [2019-12-19 05:30:00,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:00,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881455796] [2019-12-19 05:30:00,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:00,450 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-19 05:30:00,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881455796] [2019-12-19 05:30:00,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:00,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:30:00,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633802876] [2019-12-19 05:30:00,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:30:00,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:30:00,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:00,453 INFO L87 Difference]: Start difference. First operand 41884 states and 146702 transitions. Second operand 6 states. [2019-12-19 05:30:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:01,259 INFO L93 Difference]: Finished difference Result 54547 states and 184832 transitions. [2019-12-19 05:30:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:30:01,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 05:30:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:01,378 INFO L225 Difference]: With dead ends: 54547 [2019-12-19 05:30:01,379 INFO L226 Difference]: Without dead ends: 54547 [2019-12-19 05:30:01,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:30:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54547 states. [2019-12-19 05:30:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54547 to 45859. [2019-12-19 05:30:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45859 states. [2019-12-19 05:30:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45859 states to 45859 states and 158165 transitions. [2019-12-19 05:30:02,602 INFO L78 Accepts]: Start accepts. Automaton has 45859 states and 158165 transitions. Word has length 53 [2019-12-19 05:30:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:02,602 INFO L462 AbstractCegarLoop]: Abstraction has 45859 states and 158165 transitions. [2019-12-19 05:30:02,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:30:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 45859 states and 158165 transitions. [2019-12-19 05:30:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 05:30:02,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:02,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:02,614 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1583537689, now seen corresponding path program 1 times [2019-12-19 05:30:02,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:02,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943831366] [2019-12-19 05:30:02,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:02,687 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-19 05:30:02,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943831366] [2019-12-19 05:30:02,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:02,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:30:02,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659564403] [2019-12-19 05:30:02,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:30:02,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:30:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:30:02,689 INFO L87 Difference]: Start difference. First operand 45859 states and 158165 transitions. Second operand 4 states. [2019-12-19 05:30:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:02,745 INFO L93 Difference]: Finished difference Result 8161 states and 24869 transitions. [2019-12-19 05:30:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:30:02,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-19 05:30:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:02,758 INFO L225 Difference]: With dead ends: 8161 [2019-12-19 05:30:02,759 INFO L226 Difference]: Without dead ends: 6752 [2019-12-19 05:30:02,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:30:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-12-19 05:30:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6704. [2019-12-19 05:30:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6704 states. [2019-12-19 05:30:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6704 states to 6704 states and 20038 transitions. [2019-12-19 05:30:02,848 INFO L78 Accepts]: Start accepts. Automaton has 6704 states and 20038 transitions. Word has length 53 [2019-12-19 05:30:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:02,849 INFO L462 AbstractCegarLoop]: Abstraction has 6704 states and 20038 transitions. [2019-12-19 05:30:02,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:30:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 6704 states and 20038 transitions. [2019-12-19 05:30:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 05:30:02,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:02,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:02,853 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1215430140, now seen corresponding path program 1 times [2019-12-19 05:30:02,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:02,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532983063] [2019-12-19 05:30:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:02,903 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-19 05:30:02,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532983063] [2019-12-19 05:30:02,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:02,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:30:02,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048944389] [2019-12-19 05:30:02,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:30:02,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:02,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:30:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:30:02,905 INFO L87 Difference]: Start difference. First operand 6704 states and 20038 transitions. Second operand 4 states. [2019-12-19 05:30:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:03,047 INFO L93 Difference]: Finished difference Result 7889 states and 23387 transitions. [2019-12-19 05:30:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:30:03,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-19 05:30:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:03,058 INFO L225 Difference]: With dead ends: 7889 [2019-12-19 05:30:03,059 INFO L226 Difference]: Without dead ends: 7889 [2019-12-19 05:30:03,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 05:30:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2019-12-19 05:30:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 7211. [2019-12-19 05:30:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-12-19 05:30:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 21444 transitions. [2019-12-19 05:30:03,165 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 21444 transitions. Word has length 62 [2019-12-19 05:30:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:03,166 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 21444 transitions. [2019-12-19 05:30:03,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:30:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 21444 transitions. [2019-12-19 05:30:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 05:30:03,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:03,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:03,170 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1336726821, now seen corresponding path program 1 times [2019-12-19 05:30:03,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:03,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317070080] [2019-12-19 05:30:03,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:03,231 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-19 05:30:03,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317070080] [2019-12-19 05:30:03,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:03,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:30:03,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93516359] [2019-12-19 05:30:03,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:30:03,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:30:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:03,233 INFO L87 Difference]: Start difference. First operand 7211 states and 21444 transitions. Second operand 6 states. [2019-12-19 05:30:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:03,600 INFO L93 Difference]: Finished difference Result 9266 states and 27193 transitions. [2019-12-19 05:30:03,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:30:03,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 05:30:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:03,614 INFO L225 Difference]: With dead ends: 9266 [2019-12-19 05:30:03,614 INFO L226 Difference]: Without dead ends: 9218 [2019-12-19 05:30:03,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:30:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9218 states. [2019-12-19 05:30:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9218 to 8050. [2019-12-19 05:30:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8050 states. [2019-12-19 05:30:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 23824 transitions. [2019-12-19 05:30:03,764 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 23824 transitions. Word has length 62 [2019-12-19 05:30:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:03,764 INFO L462 AbstractCegarLoop]: Abstraction has 8050 states and 23824 transitions. [2019-12-19 05:30:03,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:30:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 23824 transitions. [2019-12-19 05:30:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:03,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:03,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:03,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1328482933, now seen corresponding path program 1 times [2019-12-19 05:30:03,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:03,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091524480] [2019-12-19 05:30:03,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:03,809 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-19 05:30:03,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091524480] [2019-12-19 05:30:03,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:03,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:30:03,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345398658] [2019-12-19 05:30:03,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:30:03,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:03,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:30:03,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:30:03,811 INFO L87 Difference]: Start difference. First operand 8050 states and 23824 transitions. Second operand 3 states. [2019-12-19 05:30:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:04,006 INFO L93 Difference]: Finished difference Result 8598 states and 25230 transitions. [2019-12-19 05:30:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:30:04,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-19 05:30:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:04,022 INFO L225 Difference]: With dead ends: 8598 [2019-12-19 05:30:04,022 INFO L226 Difference]: Without dead ends: 8598 [2019-12-19 05:30:04,023 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-19 05:30:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2019-12-19 05:30:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8326. [2019-12-19 05:30:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2019-12-19 05:30:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 24532 transitions. [2019-12-19 05:30:04,176 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 24532 transitions. Word has length 66 [2019-12-19 05:30:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:04,176 INFO L462 AbstractCegarLoop]: Abstraction has 8326 states and 24532 transitions. [2019-12-19 05:30:04,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:30:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 24532 transitions. [2019-12-19 05:30:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:04,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:04,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:04,187 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:04,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2004870346, now seen corresponding path program 1 times [2019-12-19 05:30:04,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:04,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842955077] [2019-12-19 05:30:04,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:04,261 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-19 05:30:04,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842955077] [2019-12-19 05:30:04,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:04,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:30:04,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167247705] [2019-12-19 05:30:04,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:30:04,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:30:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:30:04,263 INFO L87 Difference]: Start difference. First operand 8326 states and 24532 transitions. Second operand 4 states. [2019-12-19 05:30:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:04,505 INFO L93 Difference]: Finished difference Result 10939 states and 31881 transitions. [2019-12-19 05:30:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:30:04,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 05:30:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:04,526 INFO L225 Difference]: With dead ends: 10939 [2019-12-19 05:30:04,526 INFO L226 Difference]: Without dead ends: 10939 [2019-12-19 05:30:04,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:30:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10939 states. [2019-12-19 05:30:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10939 to 9349. [2019-12-19 05:30:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9349 states. [2019-12-19 05:30:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9349 states to 9349 states and 27351 transitions. [2019-12-19 05:30:04,654 INFO L78 Accepts]: Start accepts. Automaton has 9349 states and 27351 transitions. Word has length 66 [2019-12-19 05:30:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:04,655 INFO L462 AbstractCegarLoop]: Abstraction has 9349 states and 27351 transitions. [2019-12-19 05:30:04,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:30:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 9349 states and 27351 transitions. [2019-12-19 05:30:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:04,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:04,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:04,663 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1045332469, now seen corresponding path program 1 times [2019-12-19 05:30:04,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:04,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021044818] [2019-12-19 05:30:04,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:04,778 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-19 05:30:04,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021044818] [2019-12-19 05:30:04,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:04,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:30:04,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012989416] [2019-12-19 05:30:04,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:30:04,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:04,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:30:04,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:04,780 INFO L87 Difference]: Start difference. First operand 9349 states and 27351 transitions. Second operand 6 states. [2019-12-19 05:30:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:05,345 INFO L93 Difference]: Finished difference Result 10523 states and 30248 transitions. [2019-12-19 05:30:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:30:05,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 05:30:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:05,359 INFO L225 Difference]: With dead ends: 10523 [2019-12-19 05:30:05,359 INFO L226 Difference]: Without dead ends: 10523 [2019-12-19 05:30:05,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:30:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2019-12-19 05:30:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10080. [2019-12-19 05:30:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10080 states. [2019-12-19 05:30:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10080 states to 10080 states and 29117 transitions. [2019-12-19 05:30:05,484 INFO L78 Accepts]: Start accepts. Automaton has 10080 states and 29117 transitions. Word has length 66 [2019-12-19 05:30:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:05,484 INFO L462 AbstractCegarLoop]: Abstraction has 10080 states and 29117 transitions. [2019-12-19 05:30:05,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:30:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 10080 states and 29117 transitions. [2019-12-19 05:30:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:05,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:05,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:05,494 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:05,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1172425484, now seen corresponding path program 1 times [2019-12-19 05:30:05,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:05,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170053474] [2019-12-19 05:30:05,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:30:05,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170053474] [2019-12-19 05:30:05,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:05,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:30:05,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951417982] [2019-12-19 05:30:05,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:30:05,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:30:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:05,604 INFO L87 Difference]: Start difference. First operand 10080 states and 29117 transitions. Second operand 6 states. [2019-12-19 05:30:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:06,017 INFO L93 Difference]: Finished difference Result 11997 states and 33624 transitions. [2019-12-19 05:30:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:30:06,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 05:30:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:06,033 INFO L225 Difference]: With dead ends: 11997 [2019-12-19 05:30:06,033 INFO L226 Difference]: Without dead ends: 11997 [2019-12-19 05:30:06,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:30:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11997 states. [2019-12-19 05:30:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11997 to 10299. [2019-12-19 05:30:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10299 states. [2019-12-19 05:30:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10299 states to 10299 states and 29169 transitions. [2019-12-19 05:30:06,168 INFO L78 Accepts]: Start accepts. Automaton has 10299 states and 29169 transitions. Word has length 66 [2019-12-19 05:30:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:06,169 INFO L462 AbstractCegarLoop]: Abstraction has 10299 states and 29169 transitions. [2019-12-19 05:30:06,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:30:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 10299 states and 29169 transitions. [2019-12-19 05:30:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:06,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:06,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:06,177 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1383776397, now seen corresponding path program 1 times [2019-12-19 05:30:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:06,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086098217] [2019-12-19 05:30:06,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:06,264 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-19 05:30:06,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086098217] [2019-12-19 05:30:06,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:06,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:30:06,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520609368] [2019-12-19 05:30:06,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:30:06,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:30:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:30:06,266 INFO L87 Difference]: Start difference. First operand 10299 states and 29169 transitions. Second operand 5 states. [2019-12-19 05:30:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:06,643 INFO L93 Difference]: Finished difference Result 12574 states and 35462 transitions. [2019-12-19 05:30:06,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:30:06,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 05:30:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:06,660 INFO L225 Difference]: With dead ends: 12574 [2019-12-19 05:30:06,661 INFO L226 Difference]: Without dead ends: 12574 [2019-12-19 05:30:06,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:30:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12574 states. [2019-12-19 05:30:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12574 to 11074. [2019-12-19 05:30:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-19 05:30:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 31103 transitions. [2019-12-19 05:30:06,799 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 31103 transitions. Word has length 66 [2019-12-19 05:30:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:06,799 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 31103 transitions. [2019-12-19 05:30:06,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:30:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 31103 transitions. [2019-12-19 05:30:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:06,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:06,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:06,806 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:06,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:06,807 INFO L82 PathProgramCache]: Analyzing trace with hash 873242220, now seen corresponding path program 1 times [2019-12-19 05:30:06,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:06,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559329267] [2019-12-19 05:30:06,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:06,860 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-19 05:30:06,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559329267] [2019-12-19 05:30:06,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:06,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:30:06,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003555086] [2019-12-19 05:30:06,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:30:06,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:06,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:30:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:30:06,862 INFO L87 Difference]: Start difference. First operand 11074 states and 31103 transitions. Second operand 4 states. [2019-12-19 05:30:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:07,325 INFO L93 Difference]: Finished difference Result 13630 states and 38378 transitions. [2019-12-19 05:30:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:30:07,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 05:30:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:07,346 INFO L225 Difference]: With dead ends: 13630 [2019-12-19 05:30:07,346 INFO L226 Difference]: Without dead ends: 13255 [2019-12-19 05:30:07,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 05:30:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-12-19 05:30:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 12712. [2019-12-19 05:30:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12712 states. [2019-12-19 05:30:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12712 states to 12712 states and 35687 transitions. [2019-12-19 05:30:07,515 INFO L78 Accepts]: Start accepts. Automaton has 12712 states and 35687 transitions. Word has length 66 [2019-12-19 05:30:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:07,515 INFO L462 AbstractCegarLoop]: Abstraction has 12712 states and 35687 transitions. [2019-12-19 05:30:07,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:30:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12712 states and 35687 transitions. [2019-12-19 05:30:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:07,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:07,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:07,524 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -923709139, now seen corresponding path program 1 times [2019-12-19 05:30:07,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:07,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184785757] [2019-12-19 05:30:07,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:07,671 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-19 05:30:07,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184785757] [2019-12-19 05:30:07,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:07,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:30:07,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135055806] [2019-12-19 05:30:07,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:30:07,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:30:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:30:07,673 INFO L87 Difference]: Start difference. First operand 12712 states and 35687 transitions. Second operand 7 states. [2019-12-19 05:30:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:08,245 INFO L93 Difference]: Finished difference Result 15474 states and 42652 transitions. [2019-12-19 05:30:08,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:30:08,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 05:30:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:08,266 INFO L225 Difference]: With dead ends: 15474 [2019-12-19 05:30:08,266 INFO L226 Difference]: Without dead ends: 15474 [2019-12-19 05:30:08,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:30:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15474 states. [2019-12-19 05:30:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15474 to 12108. [2019-12-19 05:30:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12108 states. [2019-12-19 05:30:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12108 states to 12108 states and 33423 transitions. [2019-12-19 05:30:08,437 INFO L78 Accepts]: Start accepts. Automaton has 12108 states and 33423 transitions. Word has length 66 [2019-12-19 05:30:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:08,437 INFO L462 AbstractCegarLoop]: Abstraction has 12108 states and 33423 transitions. [2019-12-19 05:30:08,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:30:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 12108 states and 33423 transitions. [2019-12-19 05:30:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 05:30:08,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:08,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:30:08,446 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash -36205458, now seen corresponding path program 1 times [2019-12-19 05:30:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739742686] [2019-12-19 05:30:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:08,510 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-19 05:30:08,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739742686] [2019-12-19 05:30:08,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:08,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:30:08,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129671846] [2019-12-19 05:30:08,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:30:08,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:08,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:30:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:30:08,512 INFO L87 Difference]: Start difference. First operand 12108 states and 33423 transitions. Second operand 5 states. [2019-12-19 05:30:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:08,560 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-12-19 05:30:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:30:08,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 05:30:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:08,566 INFO L225 Difference]: With dead ends: 4023 [2019-12-19 05:30:08,566 INFO L226 Difference]: Without dead ends: 3350 [2019-12-19 05:30:08,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 05:30:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-12-19 05:30:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-12-19 05:30:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-12-19 05:30:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-12-19 05:30:08,612 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-12-19 05:30:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:08,612 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-12-19 05:30:08,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:30:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-12-19 05:30:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 05:30:08,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:08,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:30:08,616 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1721997520, now seen corresponding path program 1 times [2019-12-19 05:30:08,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:08,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359445576] [2019-12-19 05:30:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:08,712 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-19 05:30:08,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359445576] [2019-12-19 05:30:08,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:08,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:30:08,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572040349] [2019-12-19 05:30:08,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:30:08,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:08,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:30:08,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:30:08,714 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 7 states. [2019-12-19 05:30:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:09,363 INFO L93 Difference]: Finished difference Result 3729 states and 8437 transitions. [2019-12-19 05:30:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 05:30:09,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-19 05:30:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:09,370 INFO L225 Difference]: With dead ends: 3729 [2019-12-19 05:30:09,371 INFO L226 Difference]: Without dead ends: 3698 [2019-12-19 05:30:09,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-19 05:30:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2019-12-19 05:30:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3244. [2019-12-19 05:30:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-12-19 05:30:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 7399 transitions. [2019-12-19 05:30:09,405 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 7399 transitions. Word has length 83 [2019-12-19 05:30:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:09,405 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 7399 transitions. [2019-12-19 05:30:09,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:30:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 7399 transitions. [2019-12-19 05:30:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 05:30:09,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:09,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:30:09,411 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash -355211823, now seen corresponding path program 1 times [2019-12-19 05:30:09,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:09,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778123196] [2019-12-19 05:30:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:09,516 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-19 05:30:09,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778123196] [2019-12-19 05:30:09,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:09,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:30:09,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474594003] [2019-12-19 05:30:09,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:30:09,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:30:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:09,519 INFO L87 Difference]: Start difference. First operand 3244 states and 7399 transitions. Second operand 6 states. [2019-12-19 05:30:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:09,594 INFO L93 Difference]: Finished difference Result 5448 states and 12508 transitions. [2019-12-19 05:30:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:30:09,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 05:30:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:09,598 INFO L225 Difference]: With dead ends: 5448 [2019-12-19 05:30:09,598 INFO L226 Difference]: Without dead ends: 2293 [2019-12-19 05:30:09,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:30:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-12-19 05:30:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2019-12-19 05:30:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-12-19 05:30:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5257 transitions. [2019-12-19 05:30:09,622 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5257 transitions. Word has length 83 [2019-12-19 05:30:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:09,623 INFO L462 AbstractCegarLoop]: Abstraction has 2293 states and 5257 transitions. [2019-12-19 05:30:09,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:30:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5257 transitions. [2019-12-19 05:30:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 05:30:09,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:09,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:30:09,625 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2146119358, now seen corresponding path program 1 times [2019-12-19 05:30:09,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:09,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442453290] [2019-12-19 05:30:09,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:09,694 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-19 05:30:09,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442453290] [2019-12-19 05:30:09,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:09,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:30:09,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339463210] [2019-12-19 05:30:09,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:30:09,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:30:09,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:30:09,696 INFO L87 Difference]: Start difference. First operand 2293 states and 5257 transitions. Second operand 5 states. [2019-12-19 05:30:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:09,838 INFO L93 Difference]: Finished difference Result 2016 states and 4506 transitions. [2019-12-19 05:30:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:30:09,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-19 05:30:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:09,841 INFO L225 Difference]: With dead ends: 2016 [2019-12-19 05:30:09,841 INFO L226 Difference]: Without dead ends: 2016 [2019-12-19 05:30:09,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2019-12-19 05:30:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1756. [2019-12-19 05:30:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1756 states. [2019-12-19 05:30:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 3950 transitions. [2019-12-19 05:30:09,868 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 3950 transitions. Word has length 83 [2019-12-19 05:30:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:09,869 INFO L462 AbstractCegarLoop]: Abstraction has 1756 states and 3950 transitions. [2019-12-19 05:30:09,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:30:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3950 transitions. [2019-12-19 05:30:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 05:30:09,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:09,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:30:09,873 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1743706764, now seen corresponding path program 2 times [2019-12-19 05:30:09,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:09,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001265426] [2019-12-19 05:30:09,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:09,994 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-19 05:30:09,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001265426] [2019-12-19 05:30:09,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:09,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:30:09,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064434723] [2019-12-19 05:30:09,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:30:09,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:30:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:30:09,996 INFO L87 Difference]: Start difference. First operand 1756 states and 3950 transitions. Second operand 6 states. [2019-12-19 05:30:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:10,193 INFO L93 Difference]: Finished difference Result 1979 states and 4405 transitions. [2019-12-19 05:30:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:30:10,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 05:30:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:10,196 INFO L225 Difference]: With dead ends: 1979 [2019-12-19 05:30:10,196 INFO L226 Difference]: Without dead ends: 1939 [2019-12-19 05:30:10,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:30:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-19 05:30:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1685. [2019-12-19 05:30:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-19 05:30:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 3757 transitions. [2019-12-19 05:30:10,214 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 3757 transitions. Word has length 83 [2019-12-19 05:30:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:10,214 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 3757 transitions. [2019-12-19 05:30:10,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:30:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 3757 transitions. [2019-12-19 05:30:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 05:30:10,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:10,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:30:10,217 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:10,217 INFO L82 PathProgramCache]: Analyzing trace with hash 474051189, now seen corresponding path program 2 times [2019-12-19 05:30:10,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:10,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669714713] [2019-12-19 05:30:10,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:10,343 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-19 05:30:10,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669714713] [2019-12-19 05:30:10,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:10,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 05:30:10,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476772068] [2019-12-19 05:30:10,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 05:30:10,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 05:30:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:30:10,345 INFO L87 Difference]: Start difference. First operand 1685 states and 3757 transitions. Second operand 9 states. [2019-12-19 05:30:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:10,650 INFO L93 Difference]: Finished difference Result 3295 states and 7383 transitions. [2019-12-19 05:30:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 05:30:10,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-12-19 05:30:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:10,654 INFO L225 Difference]: With dead ends: 3295 [2019-12-19 05:30:10,654 INFO L226 Difference]: Without dead ends: 1968 [2019-12-19 05:30:10,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-19 05:30:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-12-19 05:30:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1738. [2019-12-19 05:30:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-12-19 05:30:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 3822 transitions. [2019-12-19 05:30:10,675 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 3822 transitions. Word has length 83 [2019-12-19 05:30:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:30:10,675 INFO L462 AbstractCegarLoop]: Abstraction has 1738 states and 3822 transitions. [2019-12-19 05:30:10,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 05:30:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 3822 transitions. [2019-12-19 05:30:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 05:30:10,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:10,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:30:10,678 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1193195599, now seen corresponding path program 3 times [2019-12-19 05:30:10,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:10,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826602347] [2019-12-19 05:30:10,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:30:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:30:10,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:30:10,819 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:30:11,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:30:11 BasicIcfg [2019-12-19 05:30:11,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:30:11,029 INFO L168 Benchmark]: Toolchain (without parser) took 38052.64 ms. Allocated memory was 142.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 98.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 493.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,029 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.86 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 97.9 MB in the beginning and 156.3 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,031 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 201.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,031 INFO L168 Benchmark]: RCFGBuilder took 739.48 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 111.3 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,037 INFO L168 Benchmark]: TraceAbstraction took 36431.45 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 110.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 446.4 MB. Max. memory is 7.1 GB. [2019-12-19 05:30:11,039 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.20 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.86 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 97.9 MB in the beginning and 156.3 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.65 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 201.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 739.48 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 111.3 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36431.45 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 110.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 446.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L789] 0 pthread_t t2561; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L790] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] 0 pthread_t t2562; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L732] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L732] 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) [L733] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L767] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L733] 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)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L734] 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)) [L735] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L735] 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)) [L736] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L736] 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)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L738] 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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 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 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.0s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6139 SDtfs, 7114 SDslu, 13347 SDs, 0 SdLazy, 5374 SolverSat, 381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 60 SyntacticMatches, 11 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 60804 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 262840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...