/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/mix012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:42:07,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:42:07,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:42:07,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:42:07,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:42:07,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:42:07,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:42:07,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:42:07,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:42:07,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:42:07,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:42:07,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:42:07,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:42:07,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:42:07,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:42:07,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:42:07,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:42:07,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:42:07,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:42:07,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:42:07,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:42:07,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:42:07,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:42:07,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:42:07,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:42:07,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:42:07,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:42:07,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:42:07,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:42:07,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:42:07,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:42:07,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:42:07,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:42:07,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:42:07,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:42:07,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:42:07,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:42:07,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:42:07,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:42:07,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:42:07,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:42:07,847 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 00:42:07,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:42:07,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:42:07,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:42:07,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:42:07,868 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:42:07,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:42:07,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:42:07,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:42:07,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:42:07,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:42:07,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:42:07,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:42:07,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:42:07,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:42:07,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:42:07,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:42:07,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:42:07,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:42:07,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:42:07,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:42:07,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:42:07,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:42:07,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:42:07,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:42:07,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:42:07,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:42:07,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:42:07,875 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:42:07,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:42:07,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:42:08,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:42:08,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:42:08,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:42:08,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:42:08,237 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:42:08,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-19 00:42:08,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f63df8f7/73b1df2e2da64486a46614f224444add/FLAG0bc711981 [2019-12-19 00:42:08,880 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:42:08,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-19 00:42:08,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f63df8f7/73b1df2e2da64486a46614f224444add/FLAG0bc711981 [2019-12-19 00:42:09,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f63df8f7/73b1df2e2da64486a46614f224444add [2019-12-19 00:42:09,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:42:09,210 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:42:09,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:42:09,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:42:09,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:42:09,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:09,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b73b4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09, skipping insertion in model container [2019-12-19 00:42:09,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:09,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:42:09,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:42:09,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:42:09,833 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:42:09,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:42:09,999 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:42:09,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09 WrapperNode [2019-12-19 00:42:10,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:42:10,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:42:10,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:42:10,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:42:10,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:42:10,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:42:10,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:42:10,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:42:10,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (1/1) ... [2019-12-19 00:42:10,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:42:10,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:42:10,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:42:10,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:42:10,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (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 00:42:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:42:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:42:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:42:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:42:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:42:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:42:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:42:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:42:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:42:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:42:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:42:10,162 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 00:42:10,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:42:10,890 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:42:10,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:42:10 BoogieIcfgContainer [2019-12-19 00:42:10,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:42:10,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:42:10,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:42:10,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:42:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:42:09" (1/3) ... [2019-12-19 00:42:10,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6f218b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:42:10, skipping insertion in model container [2019-12-19 00:42:10,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:42:09" (2/3) ... [2019-12-19 00:42:10,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6f218b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:42:10, skipping insertion in model container [2019-12-19 00:42:10,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:42:10" (3/3) ... [2019-12-19 00:42:10,901 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.opt.i [2019-12-19 00:42:10,912 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:42:10,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:42:10,921 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:42:10,922 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:42:10,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,965 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:10,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,024 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,024 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,030 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,033 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:42:11,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:42:11,067 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:42:11,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:42:11,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:42:11,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:42:11,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:42:11,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:42:11,068 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:42:11,068 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:42:11,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 00:42:13,331 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-19 00:42:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-19 00:42:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-19 00:42:13,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:13,342 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] [2019-12-19 00:42:13,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572936, now seen corresponding path program 1 times [2019-12-19 00:42:13,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:13,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917534123] [2019-12-19 00:42:13,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:13,654 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 00:42:13,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917534123] [2019-12-19 00:42:13,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:13,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:13,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998244417] [2019-12-19 00:42:13,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:13,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:13,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:13,681 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-19 00:42:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:14,489 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-19 00:42:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:42:14,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-19 00:42:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:14,749 INFO L225 Difference]: With dead ends: 33592 [2019-12-19 00:42:14,749 INFO L226 Difference]: Without dead ends: 25704 [2019-12-19 00:42:14,751 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 00:42:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-19 00:42:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-19 00:42:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-19 00:42:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-19 00:42:17,170 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-19 00:42:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:17,171 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-19 00:42:17,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-19 00:42:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 00:42:17,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:17,179 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] [2019-12-19 00:42:17,180 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1980442200, now seen corresponding path program 1 times [2019-12-19 00:42:17,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:17,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670148155] [2019-12-19 00:42:17,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:17,294 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 00:42:17,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670148155] [2019-12-19 00:42:17,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:17,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:17,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512674379] [2019-12-19 00:42:17,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:17,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:17,299 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-19 00:42:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:18,162 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-19 00:42:18,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:18,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 00:42:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:19,586 INFO L225 Difference]: With dead ends: 41082 [2019-12-19 00:42:19,587 INFO L226 Difference]: Without dead ends: 40546 [2019-12-19 00:42:19,588 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 00:42:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-19 00:42:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-19 00:42:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-19 00:42:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-19 00:42:20,982 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-19 00:42:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:20,984 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-19 00:42:20,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-19 00:42:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 00:42:20,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:20,991 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 00:42:20,992 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:20,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash 645631914, now seen corresponding path program 1 times [2019-12-19 00:42:20,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:20,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280190118] [2019-12-19 00:42:20,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:21,110 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 00:42:21,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280190118] [2019-12-19 00:42:21,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:21,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325766880] [2019-12-19 00:42:21,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:21,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:21,114 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-19 00:42:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:22,052 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-19 00:42:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:22,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 00:42:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:22,221 INFO L225 Difference]: With dead ends: 49779 [2019-12-19 00:42:22,221 INFO L226 Difference]: Without dead ends: 49275 [2019-12-19 00:42:22,222 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 00:42:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-19 00:42:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-19 00:42:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-19 00:42:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-19 00:42:25,183 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-19 00:42:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:25,184 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-19 00:42:25,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-19 00:42:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:42:25,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:25,193 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] [2019-12-19 00:42:25,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1346758064, now seen corresponding path program 1 times [2019-12-19 00:42:25,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:25,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386467992] [2019-12-19 00:42:25,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:25,290 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 00:42:25,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386467992] [2019-12-19 00:42:25,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:25,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:25,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262939421] [2019-12-19 00:42:25,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:25,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:25,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:25,293 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-19 00:42:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:25,954 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-19 00:42:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:25,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 00:42:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:26,150 INFO L225 Difference]: With dead ends: 61088 [2019-12-19 00:42:26,150 INFO L226 Difference]: Without dead ends: 61088 [2019-12-19 00:42:26,150 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 00:42:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-19 00:42:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-19 00:42:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-19 00:42:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-19 00:42:29,126 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-19 00:42:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:29,126 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-19 00:42:29,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-19 00:42:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:29,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:29,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:29,146 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:29,147 INFO L82 PathProgramCache]: Analyzing trace with hash 551995902, now seen corresponding path program 1 times [2019-12-19 00:42:29,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:29,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126824537] [2019-12-19 00:42:29,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:29,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 00:42:29,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126824537] [2019-12-19 00:42:29,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:29,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245795234] [2019-12-19 00:42:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:29,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:29,233 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 3 states. [2019-12-19 00:42:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:29,701 INFO L93 Difference]: Finished difference Result 53337 states and 193528 transitions. [2019-12-19 00:42:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:29,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 00:42:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:29,849 INFO L225 Difference]: With dead ends: 53337 [2019-12-19 00:42:29,850 INFO L226 Difference]: Without dead ends: 53337 [2019-12-19 00:42:29,850 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 00:42:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-19 00:42:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 50675. [2019-12-19 00:42:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50675 states. [2019-12-19 00:42:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50675 states to 50675 states and 183848 transitions. [2019-12-19 00:42:31,557 INFO L78 Accepts]: Start accepts. Automaton has 50675 states and 183848 transitions. Word has length 54 [2019-12-19 00:42:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:31,557 INFO L462 AbstractCegarLoop]: Abstraction has 50675 states and 183848 transitions. [2019-12-19 00:42:31,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 50675 states and 183848 transitions. [2019-12-19 00:42:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:31,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:31,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:31,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash -962055554, now seen corresponding path program 1 times [2019-12-19 00:42:31,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:31,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138314192] [2019-12-19 00:42:31,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:31,735 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 00:42:31,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138314192] [2019-12-19 00:42:31,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:31,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:31,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014454279] [2019-12-19 00:42:31,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:31,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:31,737 INFO L87 Difference]: Start difference. First operand 50675 states and 183848 transitions. Second operand 6 states. [2019-12-19 00:42:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:33,998 INFO L93 Difference]: Finished difference Result 65267 states and 234906 transitions. [2019-12-19 00:42:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:33,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 00:42:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:34,149 INFO L225 Difference]: With dead ends: 65267 [2019-12-19 00:42:34,149 INFO L226 Difference]: Without dead ends: 65267 [2019-12-19 00:42:34,150 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 00:42:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65267 states. [2019-12-19 00:42:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65267 to 59950. [2019-12-19 00:42:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-19 00:42:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-19 00:42:35,554 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-19 00:42:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:35,555 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-19 00:42:35,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-19 00:42:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:35,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:35,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:35,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1535960383, now seen corresponding path program 1 times [2019-12-19 00:42:35,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:35,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273552464] [2019-12-19 00:42:35,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:35,674 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 00:42:35,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273552464] [2019-12-19 00:42:35,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:35,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:42:35,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288817606] [2019-12-19 00:42:35,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:42:35,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:42:35,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:42:35,677 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-12-19 00:42:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:37,679 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-12-19 00:42:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:42:37,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 00:42:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:37,886 INFO L225 Difference]: With dead ends: 83686 [2019-12-19 00:42:37,886 INFO L226 Difference]: Without dead ends: 83686 [2019-12-19 00:42:37,886 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 00:42:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-12-19 00:42:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-12-19 00:42:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-12-19 00:42:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-12-19 00:42:41,952 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-12-19 00:42:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:41,952 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-12-19 00:42:41,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:42:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-12-19 00:42:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:41,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:41,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:41,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1871503232, now seen corresponding path program 1 times [2019-12-19 00:42:41,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:41,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663533393] [2019-12-19 00:42:41,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:42,063 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 00:42:42,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663533393] [2019-12-19 00:42:42,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:42,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:42,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937286014] [2019-12-19 00:42:42,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:42,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:42,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:42,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:42,066 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 3 states. [2019-12-19 00:42:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:42,405 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-12-19 00:42:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:42,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 00:42:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:42,566 INFO L225 Difference]: With dead ends: 54022 [2019-12-19 00:42:42,566 INFO L226 Difference]: Without dead ends: 54022 [2019-12-19 00:42:42,566 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 00:42:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-12-19 00:42:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-12-19 00:42:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-12-19 00:42:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-12-19 00:42:44,065 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-12-19 00:42:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:44,065 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-12-19 00:42:44,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-12-19 00:42:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:44,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:44,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:44,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:44,076 INFO L82 PathProgramCache]: Analyzing trace with hash 683903899, now seen corresponding path program 1 times [2019-12-19 00:42:44,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:44,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162625154] [2019-12-19 00:42:44,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:44,140 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 00:42:44,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162625154] [2019-12-19 00:42:44,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:44,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:44,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570470905] [2019-12-19 00:42:44,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:44,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:44,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:44,143 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-12-19 00:42:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:44,913 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-12-19 00:42:44,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:42:44,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 00:42:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:45,069 INFO L225 Difference]: With dead ends: 68647 [2019-12-19 00:42:45,070 INFO L226 Difference]: Without dead ends: 68079 [2019-12-19 00:42:45,070 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 00:42:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-12-19 00:42:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-12-19 00:42:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-12-19 00:42:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-12-19 00:42:46,773 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-12-19 00:42:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:46,773 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-12-19 00:42:46,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-12-19 00:42:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 00:42:46,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:46,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:46,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2138375800, now seen corresponding path program 1 times [2019-12-19 00:42:46,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:46,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468590461] [2019-12-19 00:42:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:46,857 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 00:42:46,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468590461] [2019-12-19 00:42:46,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:46,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:46,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118018824] [2019-12-19 00:42:46,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:46,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:46,860 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 6 states. [2019-12-19 00:42:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:47,959 INFO L93 Difference]: Finished difference Result 96426 states and 331754 transitions. [2019-12-19 00:42:47,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:42:47,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 00:42:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:48,166 INFO L225 Difference]: With dead ends: 96426 [2019-12-19 00:42:48,166 INFO L226 Difference]: Without dead ends: 96426 [2019-12-19 00:42:48,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:42:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96426 states. [2019-12-19 00:42:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96426 to 70775. [2019-12-19 00:42:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70775 states. [2019-12-19 00:42:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70775 states to 70775 states and 244811 transitions. [2019-12-19 00:42:52,640 INFO L78 Accepts]: Start accepts. Automaton has 70775 states and 244811 transitions. Word has length 55 [2019-12-19 00:42:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:52,640 INFO L462 AbstractCegarLoop]: Abstraction has 70775 states and 244811 transitions. [2019-12-19 00:42:52,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 70775 states and 244811 transitions. [2019-12-19 00:42:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 00:42:52,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:52,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:52,656 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1250872119, now seen corresponding path program 1 times [2019-12-19 00:42:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:52,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777126925] [2019-12-19 00:42:52,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:52,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777126925] [2019-12-19 00:42:52,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:52,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:52,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742301528] [2019-12-19 00:42:52,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:52,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:52,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:52,721 INFO L87 Difference]: Start difference. First operand 70775 states and 244811 transitions. Second operand 4 states. [2019-12-19 00:42:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:52,787 INFO L93 Difference]: Finished difference Result 12388 states and 37623 transitions. [2019-12-19 00:42:52,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:42:52,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 00:42:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:52,807 INFO L225 Difference]: With dead ends: 12388 [2019-12-19 00:42:52,807 INFO L226 Difference]: Without dead ends: 10683 [2019-12-19 00:42:52,807 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 00:42:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10683 states. [2019-12-19 00:42:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10683 to 10635. [2019-12-19 00:42:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10635 states. [2019-12-19 00:42:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10635 states to 10635 states and 31702 transitions. [2019-12-19 00:42:52,945 INFO L78 Accepts]: Start accepts. Automaton has 10635 states and 31702 transitions. Word has length 55 [2019-12-19 00:42:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:52,945 INFO L462 AbstractCegarLoop]: Abstraction has 10635 states and 31702 transitions. [2019-12-19 00:42:52,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10635 states and 31702 transitions. [2019-12-19 00:42:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 00:42:52,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:52,949 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 00:42:52,949 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1727879850, now seen corresponding path program 1 times [2019-12-19 00:42:52,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245627873] [2019-12-19 00:42:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:53,012 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 00:42:53,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245627873] [2019-12-19 00:42:53,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:53,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:53,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952349315] [2019-12-19 00:42:53,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:53,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:53,014 INFO L87 Difference]: Start difference. First operand 10635 states and 31702 transitions. Second operand 6 states. [2019-12-19 00:42:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:53,458 INFO L93 Difference]: Finished difference Result 13426 states and 39491 transitions. [2019-12-19 00:42:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:42:53,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 00:42:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:53,477 INFO L225 Difference]: With dead ends: 13426 [2019-12-19 00:42:53,477 INFO L226 Difference]: Without dead ends: 13365 [2019-12-19 00:42:53,477 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 00:42:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13365 states. [2019-12-19 00:42:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13365 to 12496. [2019-12-19 00:42:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12496 states. [2019-12-19 00:42:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12496 states to 12496 states and 36972 transitions. [2019-12-19 00:42:53,645 INFO L78 Accepts]: Start accepts. Automaton has 12496 states and 36972 transitions. Word has length 62 [2019-12-19 00:42:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:53,646 INFO L462 AbstractCegarLoop]: Abstraction has 12496 states and 36972 transitions. [2019-12-19 00:42:53,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12496 states and 36972 transitions. [2019-12-19 00:42:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:53,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:53,652 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] [2019-12-19 00:42:53,652 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1375454527, now seen corresponding path program 1 times [2019-12-19 00:42:53,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:53,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540409373] [2019-12-19 00:42:53,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:53,709 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 00:42:53,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540409373] [2019-12-19 00:42:53,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:53,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:53,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425016109] [2019-12-19 00:42:53,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:53,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:53,711 INFO L87 Difference]: Start difference. First operand 12496 states and 36972 transitions. Second operand 4 states. [2019-12-19 00:42:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:54,042 INFO L93 Difference]: Finished difference Result 15434 states and 45248 transitions. [2019-12-19 00:42:54,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:42:54,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 00:42:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:54,075 INFO L225 Difference]: With dead ends: 15434 [2019-12-19 00:42:54,075 INFO L226 Difference]: Without dead ends: 15434 [2019-12-19 00:42:54,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 00:42:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15434 states. [2019-12-19 00:42:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15434 to 13703. [2019-12-19 00:42:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13703 states. [2019-12-19 00:42:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13703 states to 13703 states and 40300 transitions. [2019-12-19 00:42:54,360 INFO L78 Accepts]: Start accepts. Automaton has 13703 states and 40300 transitions. Word has length 68 [2019-12-19 00:42:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:54,361 INFO L462 AbstractCegarLoop]: Abstraction has 13703 states and 40300 transitions. [2019-12-19 00:42:54,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 13703 states and 40300 transitions. [2019-12-19 00:42:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:54,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:54,374 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] [2019-12-19 00:42:54,374 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash -130690046, now seen corresponding path program 1 times [2019-12-19 00:42:54,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:54,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583519053] [2019-12-19 00:42:54,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:54,485 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 00:42:54,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583519053] [2019-12-19 00:42:54,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:54,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:54,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388129303] [2019-12-19 00:42:54,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:54,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:54,487 INFO L87 Difference]: Start difference. First operand 13703 states and 40300 transitions. Second operand 6 states. [2019-12-19 00:42:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:55,143 INFO L93 Difference]: Finished difference Result 14885 states and 43149 transitions. [2019-12-19 00:42:55,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:55,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:42:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:55,167 INFO L225 Difference]: With dead ends: 14885 [2019-12-19 00:42:55,167 INFO L226 Difference]: Without dead ends: 14885 [2019-12-19 00:42:55,168 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 00:42:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14885 states. [2019-12-19 00:42:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14885 to 14566. [2019-12-19 00:42:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14566 states. [2019-12-19 00:42:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14566 states to 14566 states and 42339 transitions. [2019-12-19 00:42:55,634 INFO L78 Accepts]: Start accepts. Automaton has 14566 states and 42339 transitions. Word has length 68 [2019-12-19 00:42:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:55,634 INFO L462 AbstractCegarLoop]: Abstraction has 14566 states and 42339 transitions. [2019-12-19 00:42:55,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 14566 states and 42339 transitions. [2019-12-19 00:42:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:55,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:55,642 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] [2019-12-19 00:42:55,643 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2087067907, now seen corresponding path program 1 times [2019-12-19 00:42:55,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:55,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285449065] [2019-12-19 00:42:55,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:55,757 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 00:42:55,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285449065] [2019-12-19 00:42:55,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:55,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334638012] [2019-12-19 00:42:55,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:55,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:55,759 INFO L87 Difference]: Start difference. First operand 14566 states and 42339 transitions. Second operand 6 states. [2019-12-19 00:42:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:56,249 INFO L93 Difference]: Finished difference Result 16592 states and 46994 transitions. [2019-12-19 00:42:56,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:42:56,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:42:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:56,273 INFO L225 Difference]: With dead ends: 16592 [2019-12-19 00:42:56,273 INFO L226 Difference]: Without dead ends: 16592 [2019-12-19 00:42:56,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:42:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16592 states. [2019-12-19 00:42:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16592 to 15096. [2019-12-19 00:42:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15096 states. [2019-12-19 00:42:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15096 states to 15096 states and 43217 transitions. [2019-12-19 00:42:56,474 INFO L78 Accepts]: Start accepts. Automaton has 15096 states and 43217 transitions. Word has length 68 [2019-12-19 00:42:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:56,474 INFO L462 AbstractCegarLoop]: Abstraction has 15096 states and 43217 transitions. [2019-12-19 00:42:56,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 15096 states and 43217 transitions. [2019-12-19 00:42:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:56,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:56,482 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] [2019-12-19 00:42:56,482 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1996548476, now seen corresponding path program 1 times [2019-12-19 00:42:56,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:56,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91666666] [2019-12-19 00:42:56,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:56,548 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 00:42:56,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91666666] [2019-12-19 00:42:56,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:56,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:56,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667200534] [2019-12-19 00:42:56,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:56,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:56,550 INFO L87 Difference]: Start difference. First operand 15096 states and 43217 transitions. Second operand 5 states. [2019-12-19 00:42:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:56,919 INFO L93 Difference]: Finished difference Result 18786 states and 53537 transitions. [2019-12-19 00:42:56,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:42:56,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:42:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:56,944 INFO L225 Difference]: With dead ends: 18786 [2019-12-19 00:42:56,944 INFO L226 Difference]: Without dead ends: 18786 [2019-12-19 00:42:56,945 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 00:42:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18786 states. [2019-12-19 00:42:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18786 to 17523. [2019-12-19 00:42:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17523 states. [2019-12-19 00:42:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17523 states to 17523 states and 49846 transitions. [2019-12-19 00:42:57,168 INFO L78 Accepts]: Start accepts. Automaton has 17523 states and 49846 transitions. Word has length 68 [2019-12-19 00:42:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:57,168 INFO L462 AbstractCegarLoop]: Abstraction has 17523 states and 49846 transitions. [2019-12-19 00:42:57,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17523 states and 49846 transitions. [2019-12-19 00:42:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:57,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:57,176 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] [2019-12-19 00:42:57,176 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1787884643, now seen corresponding path program 1 times [2019-12-19 00:42:57,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:57,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32932763] [2019-12-19 00:42:57,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:57,241 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 00:42:57,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32932763] [2019-12-19 00:42:57,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:57,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:57,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090878098] [2019-12-19 00:42:57,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:57,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:57,243 INFO L87 Difference]: Start difference. First operand 17523 states and 49846 transitions. Second operand 4 states. [2019-12-19 00:42:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:57,818 INFO L93 Difference]: Finished difference Result 20772 states and 58888 transitions. [2019-12-19 00:42:57,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:42:57,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 00:42:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:57,845 INFO L225 Difference]: With dead ends: 20772 [2019-12-19 00:42:57,845 INFO L226 Difference]: Without dead ends: 20550 [2019-12-19 00:42:57,845 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 00:42:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20550 states. [2019-12-19 00:42:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20550 to 19695. [2019-12-19 00:42:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19695 states. [2019-12-19 00:42:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19695 states to 19695 states and 55770 transitions. [2019-12-19 00:42:58,085 INFO L78 Accepts]: Start accepts. Automaton has 19695 states and 55770 transitions. Word has length 68 [2019-12-19 00:42:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:58,086 INFO L462 AbstractCegarLoop]: Abstraction has 19695 states and 55770 transitions. [2019-12-19 00:42:58,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 19695 states and 55770 transitions. [2019-12-19 00:42:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:58,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:58,093 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] [2019-12-19 00:42:58,093 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash -896570397, now seen corresponding path program 1 times [2019-12-19 00:42:58,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:58,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545926545] [2019-12-19 00:42:58,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:58,208 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 00:42:58,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545926545] [2019-12-19 00:42:58,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:58,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:42:58,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828055691] [2019-12-19 00:42:58,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:42:58,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:42:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:42:58,212 INFO L87 Difference]: Start difference. First operand 19695 states and 55770 transitions. Second operand 9 states. [2019-12-19 00:42:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:59,540 INFO L93 Difference]: Finished difference Result 26790 states and 75550 transitions. [2019-12-19 00:42:59,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:42:59,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-19 00:42:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:59,580 INFO L225 Difference]: With dead ends: 26790 [2019-12-19 00:42:59,580 INFO L226 Difference]: Without dead ends: 26790 [2019-12-19 00:42:59,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:42:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26790 states. [2019-12-19 00:42:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26790 to 22284. [2019-12-19 00:42:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-19 00:42:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 62834 transitions. [2019-12-19 00:42:59,920 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 62834 transitions. Word has length 68 [2019-12-19 00:42:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:59,920 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 62834 transitions. [2019-12-19 00:42:59,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:42:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 62834 transitions. [2019-12-19 00:42:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:59,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:59,929 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] [2019-12-19 00:42:59,929 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -9066716, now seen corresponding path program 1 times [2019-12-19 00:42:59,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:59,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666870345] [2019-12-19 00:42:59,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:59,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666870345] [2019-12-19 00:42:59,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:59,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:59,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835743165] [2019-12-19 00:43:00,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:43:00,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:00,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:43:00,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:00,002 INFO L87 Difference]: Start difference. First operand 22284 states and 62834 transitions. Second operand 5 states. [2019-12-19 00:43:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:00,060 INFO L93 Difference]: Finished difference Result 6039 states and 14246 transitions. [2019-12-19 00:43:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:43:00,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:43:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:00,067 INFO L225 Difference]: With dead ends: 6039 [2019-12-19 00:43:00,067 INFO L226 Difference]: Without dead ends: 5139 [2019-12-19 00:43:00,067 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 00:43:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-12-19 00:43:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4546. [2019-12-19 00:43:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4546 states. [2019-12-19 00:43:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 10433 transitions. [2019-12-19 00:43:00,132 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 10433 transitions. Word has length 68 [2019-12-19 00:43:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:00,132 INFO L462 AbstractCegarLoop]: Abstraction has 4546 states and 10433 transitions. [2019-12-19 00:43:00,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:43:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 10433 transitions. [2019-12-19 00:43:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:43:00,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:00,137 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] [2019-12-19 00:43:00,137 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1271293831, now seen corresponding path program 1 times [2019-12-19 00:43:00,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:00,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446777704] [2019-12-19 00:43:00,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:00,168 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 00:43:00,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446777704] [2019-12-19 00:43:00,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:00,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:43:00,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357356719] [2019-12-19 00:43:00,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:43:00,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:43:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:43:00,170 INFO L87 Difference]: Start difference. First operand 4546 states and 10433 transitions. Second operand 3 states. [2019-12-19 00:43:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:00,204 INFO L93 Difference]: Finished difference Result 5698 states and 12897 transitions. [2019-12-19 00:43:00,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:43:00,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 00:43:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:00,212 INFO L225 Difference]: With dead ends: 5698 [2019-12-19 00:43:00,212 INFO L226 Difference]: Without dead ends: 5698 [2019-12-19 00:43:00,213 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 00:43:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2019-12-19 00:43:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 4494. [2019-12-19 00:43:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4494 states. [2019-12-19 00:43:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 4494 states and 10035 transitions. [2019-12-19 00:43:00,278 INFO L78 Accepts]: Start accepts. Automaton has 4494 states and 10035 transitions. Word has length 68 [2019-12-19 00:43:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:00,278 INFO L462 AbstractCegarLoop]: Abstraction has 4494 states and 10035 transitions. [2019-12-19 00:43:00,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:43:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 10035 transitions. [2019-12-19 00:43:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-19 00:43:00,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:00,283 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] [2019-12-19 00:43:00,283 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash 186991737, now seen corresponding path program 1 times [2019-12-19 00:43:00,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:00,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002793247] [2019-12-19 00:43:00,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:00,367 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 00:43:00,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002793247] [2019-12-19 00:43:00,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:00,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:43:00,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231407283] [2019-12-19 00:43:00,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:43:00,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:43:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:00,370 INFO L87 Difference]: Start difference. First operand 4494 states and 10035 transitions. Second operand 7 states. [2019-12-19 00:43:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:00,830 INFO L93 Difference]: Finished difference Result 5360 states and 11881 transitions. [2019-12-19 00:43:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:43:00,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-19 00:43:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:00,837 INFO L225 Difference]: With dead ends: 5360 [2019-12-19 00:43:00,837 INFO L226 Difference]: Without dead ends: 5307 [2019-12-19 00:43:00,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 00:43:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2019-12-19 00:43:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 4510. [2019-12-19 00:43:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4510 states. [2019-12-19 00:43:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 9998 transitions. [2019-12-19 00:43:00,884 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 9998 transitions. Word has length 74 [2019-12-19 00:43:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:00,885 INFO L462 AbstractCegarLoop]: Abstraction has 4510 states and 9998 transitions. [2019-12-19 00:43:00,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:43:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 9998 transitions. [2019-12-19 00:43:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:43:00,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:00,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:00,889 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1782611977, now seen corresponding path program 1 times [2019-12-19 00:43:00,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:00,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252722298] [2019-12-19 00:43:00,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:00,954 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 00:43:00,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252722298] [2019-12-19 00:43:00,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:00,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:43:00,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805629141] [2019-12-19 00:43:00,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:43:00,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:00,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:43:00,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:00,956 INFO L87 Difference]: Start difference. First operand 4510 states and 9998 transitions. Second operand 4 states. [2019-12-19 00:43:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:01,086 INFO L93 Difference]: Finished difference Result 5451 states and 12009 transitions. [2019-12-19 00:43:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:43:01,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-19 00:43:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:01,094 INFO L225 Difference]: With dead ends: 5451 [2019-12-19 00:43:01,094 INFO L226 Difference]: Without dead ends: 5451 [2019-12-19 00:43:01,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:43:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2019-12-19 00:43:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 4760. [2019-12-19 00:43:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2019-12-19 00:43:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 10544 transitions. [2019-12-19 00:43:01,171 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 10544 transitions. Word has length 95 [2019-12-19 00:43:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:01,172 INFO L462 AbstractCegarLoop]: Abstraction has 4760 states and 10544 transitions. [2019-12-19 00:43:01,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:43:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 10544 transitions. [2019-12-19 00:43:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:01,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:01,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:01,181 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1647418300, now seen corresponding path program 1 times [2019-12-19 00:43:01,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:01,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885748691] [2019-12-19 00:43:01,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:01,308 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 00:43:01,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885748691] [2019-12-19 00:43:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:01,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:43:01,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930336170] [2019-12-19 00:43:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:43:01,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:43:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:43:01,317 INFO L87 Difference]: Start difference. First operand 4760 states and 10544 transitions. Second operand 4 states. [2019-12-19 00:43:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:01,467 INFO L93 Difference]: Finished difference Result 5191 states and 11511 transitions. [2019-12-19 00:43:01,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:43:01,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 00:43:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:01,475 INFO L225 Difference]: With dead ends: 5191 [2019-12-19 00:43:01,475 INFO L226 Difference]: Without dead ends: 5191 [2019-12-19 00:43:01,476 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 00:43:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2019-12-19 00:43:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 4831. [2019-12-19 00:43:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4831 states. [2019-12-19 00:43:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 10695 transitions. [2019-12-19 00:43:01,573 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 10695 transitions. Word has length 97 [2019-12-19 00:43:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:01,574 INFO L462 AbstractCegarLoop]: Abstraction has 4831 states and 10695 transitions. [2019-12-19 00:43:01,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:43:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 10695 transitions. [2019-12-19 00:43:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:01,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:01,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:01,583 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1547570917, now seen corresponding path program 1 times [2019-12-19 00:43:01,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:01,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219572753] [2019-12-19 00:43:01,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:43:01,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219572753] [2019-12-19 00:43:01,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:01,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:43:01,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512815465] [2019-12-19 00:43:01,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:43:01,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:01,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:43:01,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:01,768 INFO L87 Difference]: Start difference. First operand 4831 states and 10695 transitions. Second operand 7 states. [2019-12-19 00:43:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:02,034 INFO L93 Difference]: Finished difference Result 5670 states and 12483 transitions. [2019-12-19 00:43:02,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:43:02,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 00:43:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:02,042 INFO L225 Difference]: With dead ends: 5670 [2019-12-19 00:43:02,043 INFO L226 Difference]: Without dead ends: 5670 [2019-12-19 00:43:02,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:43:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2019-12-19 00:43:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 4838. [2019-12-19 00:43:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2019-12-19 00:43:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 10682 transitions. [2019-12-19 00:43:02,128 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 10682 transitions. Word has length 97 [2019-12-19 00:43:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:02,129 INFO L462 AbstractCegarLoop]: Abstraction has 4838 states and 10682 transitions. [2019-12-19 00:43:02,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:43:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 10682 transitions. [2019-12-19 00:43:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:02,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:02,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:02,136 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -429791043, now seen corresponding path program 1 times [2019-12-19 00:43:02,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:02,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125198591] [2019-12-19 00:43:02,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:02,240 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 00:43:02,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125198591] [2019-12-19 00:43:02,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:02,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:43:02,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048932037] [2019-12-19 00:43:02,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:43:02,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:02,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:43:02,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:43:02,243 INFO L87 Difference]: Start difference. First operand 4838 states and 10682 transitions. Second operand 7 states. [2019-12-19 00:43:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:02,691 INFO L93 Difference]: Finished difference Result 6220 states and 13695 transitions. [2019-12-19 00:43:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 00:43:02,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 00:43:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:02,700 INFO L225 Difference]: With dead ends: 6220 [2019-12-19 00:43:02,700 INFO L226 Difference]: Without dead ends: 6220 [2019-12-19 00:43:02,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 00:43:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2019-12-19 00:43:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 5613. [2019-12-19 00:43:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-12-19 00:43:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 12409 transitions. [2019-12-19 00:43:02,760 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 12409 transitions. Word has length 97 [2019-12-19 00:43:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:02,761 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 12409 transitions. [2019-12-19 00:43:02,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:43:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 12409 transitions. [2019-12-19 00:43:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:02,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:02,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:02,769 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:02,769 INFO L82 PathProgramCache]: Analyzing trace with hash 670187036, now seen corresponding path program 1 times [2019-12-19 00:43:02,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:02,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486318239] [2019-12-19 00:43:02,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:02,958 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 00:43:02,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486318239] [2019-12-19 00:43:02,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:02,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:43:02,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864792906] [2019-12-19 00:43:02,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:43:02,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:43:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:43:02,963 INFO L87 Difference]: Start difference. First operand 5613 states and 12409 transitions. Second operand 9 states. [2019-12-19 00:43:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:03,796 INFO L93 Difference]: Finished difference Result 7298 states and 15926 transitions. [2019-12-19 00:43:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 00:43:03,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-19 00:43:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:03,809 INFO L225 Difference]: With dead ends: 7298 [2019-12-19 00:43:03,809 INFO L226 Difference]: Without dead ends: 7298 [2019-12-19 00:43:03,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-19 00:43:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7298 states. [2019-12-19 00:43:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7298 to 6114. [2019-12-19 00:43:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6114 states. [2019-12-19 00:43:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 13440 transitions. [2019-12-19 00:43:03,946 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 13440 transitions. Word has length 97 [2019-12-19 00:43:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:03,947 INFO L462 AbstractCegarLoop]: Abstraction has 6114 states and 13440 transitions. [2019-12-19 00:43:03,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:43:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 13440 transitions. [2019-12-19 00:43:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:03,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:03,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:03,960 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash 881537949, now seen corresponding path program 1 times [2019-12-19 00:43:03,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:03,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475717621] [2019-12-19 00:43:03,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:04,193 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 00:43:04,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475717621] [2019-12-19 00:43:04,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:04,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-19 00:43:04,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391404983] [2019-12-19 00:43:04,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-19 00:43:04,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:04,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-19 00:43:04,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:43:04,196 INFO L87 Difference]: Start difference. First operand 6114 states and 13440 transitions. Second operand 13 states. [2019-12-19 00:43:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:05,775 INFO L93 Difference]: Finished difference Result 9377 states and 20166 transitions. [2019-12-19 00:43:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 00:43:05,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-19 00:43:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:05,787 INFO L225 Difference]: With dead ends: 9377 [2019-12-19 00:43:05,787 INFO L226 Difference]: Without dead ends: 9377 [2019-12-19 00:43:05,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-19 00:43:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2019-12-19 00:43:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 6658. [2019-12-19 00:43:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2019-12-19 00:43:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 14643 transitions. [2019-12-19 00:43:05,864 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 14643 transitions. Word has length 97 [2019-12-19 00:43:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:05,864 INFO L462 AbstractCegarLoop]: Abstraction has 6658 states and 14643 transitions. [2019-12-19 00:43:05,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-19 00:43:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 14643 transitions. [2019-12-19 00:43:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:05,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:05,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:05,870 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1769041630, now seen corresponding path program 1 times [2019-12-19 00:43:05,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:05,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224004090] [2019-12-19 00:43:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:43:06,045 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 00:43:06,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224004090] [2019-12-19 00:43:06,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:43:06,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 00:43:06,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680181812] [2019-12-19 00:43:06,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 00:43:06,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:43:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 00:43:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:43:06,047 INFO L87 Difference]: Start difference. First operand 6658 states and 14643 transitions. Second operand 10 states. [2019-12-19 00:43:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:43:06,544 INFO L93 Difference]: Finished difference Result 19689 states and 43823 transitions. [2019-12-19 00:43:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:43:06,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-19 00:43:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:43:06,561 INFO L225 Difference]: With dead ends: 19689 [2019-12-19 00:43:06,561 INFO L226 Difference]: Without dead ends: 13134 [2019-12-19 00:43:06,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 00:43:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13134 states. [2019-12-19 00:43:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13134 to 6526. [2019-12-19 00:43:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-19 00:43:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 14292 transitions. [2019-12-19 00:43:06,666 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 14292 transitions. Word has length 97 [2019-12-19 00:43:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:43:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 14292 transitions. [2019-12-19 00:43:06,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 00:43:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 14292 transitions. [2019-12-19 00:43:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:43:06,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:43:06,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:43:06,673 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:43:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:43:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1980984750, now seen corresponding path program 2 times [2019-12-19 00:43:06,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:43:06,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555114949] [2019-12-19 00:43:06,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:43:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:43:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:43:06,767 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:43:06,767 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:43:06,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:43:06 BasicIcfg [2019-12-19 00:43:06,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:43:06,979 INFO L168 Benchmark]: Toolchain (without parser) took 57769.10 ms. Allocated memory was 146.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 103.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,980 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 146.8 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.13 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 103.0 MB in the beginning and 157.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,981 INFO L168 Benchmark]: Boogie Preprocessor took 36.69 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,982 INFO L168 Benchmark]: RCFGBuilder took 794.57 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,982 INFO L168 Benchmark]: TraceAbstraction took 56084.00 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 108.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 00:43:06,985 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.55 ms. Allocated memory is still 146.8 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.13 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 103.0 MB in the beginning and 157.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.69 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.57 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56084.00 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 108.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t307; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 pthread_t t308; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] FCALL, FORK 0 pthread_create(&t308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.7s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8040 SDtfs, 9051 SDslu, 20617 SDs, 0 SdLazy, 9002 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 83 SyntacticMatches, 19 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred 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: 27.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 109476 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2014 NumberOfCodeBlocks, 2014 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1889 ConstructedInterpolants, 0 QuantifiedInterpolants, 385061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...