/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/mix022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 01:23:05,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 01:23:05,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 01:23:05,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 01:23:05,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 01:23:05,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 01:23:05,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 01:23:05,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 01:23:05,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 01:23:05,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 01:23:05,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 01:23:05,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 01:23:05,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 01:23:05,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 01:23:05,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 01:23:05,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 01:23:05,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 01:23:05,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 01:23:05,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 01:23:05,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 01:23:05,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 01:23:05,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 01:23:05,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 01:23:05,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 01:23:05,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 01:23:05,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 01:23:05,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 01:23:05,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 01:23:05,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 01:23:05,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 01:23:05,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 01:23:05,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 01:23:05,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 01:23:05,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 01:23:05,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 01:23:05,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 01:23:05,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 01:23:05,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 01:23:05,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 01:23:05,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 01:23:05,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 01:23:05,873 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 01:23:05,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 01:23:05,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 01:23:05,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 01:23:05,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 01:23:05,891 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 01:23:05,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 01:23:05,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 01:23:05,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 01:23:05,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 01:23:05,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 01:23:05,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 01:23:05,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 01:23:05,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 01:23:05,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 01:23:05,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 01:23:05,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 01:23:05,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 01:23:05,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 01:23:05,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 01:23:05,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 01:23:05,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 01:23:05,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 01:23:05,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 01:23:05,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 01:23:05,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 01:23:05,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 01:23:05,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 01:23:05,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 01:23:05,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 01:23:05,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 01:23:06,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 01:23:06,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 01:23:06,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 01:23:06,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 01:23:06,203 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 01:23:06,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-19 01:23:06,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1316e9ca5/69df5b0626fb47588979d024b7738301/FLAG756a0b1a7 [2019-12-19 01:23:06,818 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 01:23:06,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-19 01:23:06,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1316e9ca5/69df5b0626fb47588979d024b7738301/FLAG756a0b1a7 [2019-12-19 01:23:07,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1316e9ca5/69df5b0626fb47588979d024b7738301 [2019-12-19 01:23:07,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 01:23:07,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 01:23:07,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 01:23:07,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 01:23:07,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 01:23:07,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54870408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07, skipping insertion in model container [2019-12-19 01:23:07,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 01:23:07,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 01:23:07,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 01:23:07,750 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 01:23:07,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 01:23:07,900 INFO L208 MainTranslator]: Completed translation [2019-12-19 01:23:07,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07 WrapperNode [2019-12-19 01:23:07,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 01:23:07,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 01:23:07,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 01:23:07,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 01:23:07,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 01:23:07,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 01:23:07,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 01:23:07,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 01:23:07,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:07,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:08,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (1/1) ... [2019-12-19 01:23:08,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 01:23:08,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 01:23:08,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 01:23:08,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 01:23:08,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (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 01:23:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 01:23:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 01:23:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 01:23:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 01:23:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 01:23:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 01:23:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 01:23:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 01:23:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 01:23:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 01:23:08,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 01:23:08,091 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 01:23:08,834 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 01:23:08,835 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 01:23:08,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:23:08 BoogieIcfgContainer [2019-12-19 01:23:08,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 01:23:08,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 01:23:08,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 01:23:08,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 01:23:08,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:23:07" (1/3) ... [2019-12-19 01:23:08,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab2b6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:23:08, skipping insertion in model container [2019-12-19 01:23:08,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:07" (2/3) ... [2019-12-19 01:23:08,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab2b6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:23:08, skipping insertion in model container [2019-12-19 01:23:08,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:23:08" (3/3) ... [2019-12-19 01:23:08,845 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-19 01:23:08,856 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 01:23:08,857 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 01:23:08,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 01:23:08,866 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 01:23:08,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,907 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,967 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,968 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,970 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:08,998 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 01:23:09,022 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 01:23:09,022 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 01:23:09,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 01:23:09,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 01:23:09,023 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 01:23:09,023 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 01:23:09,023 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 01:23:09,023 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 01:23:09,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-19 01:23:11,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-19 01:23:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-19 01:23:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-19 01:23:11,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:11,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:11,080 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:11,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:11,087 INFO L82 PathProgramCache]: Analyzing trace with hash 515763664, now seen corresponding path program 1 times [2019-12-19 01:23:11,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:11,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134783647] [2019-12-19 01:23:11,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:11,424 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 01:23:11,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134783647] [2019-12-19 01:23:11,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:11,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:11,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519432950] [2019-12-19 01:23:11,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:11,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:11,450 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-19 01:23:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:12,953 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-19 01:23:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:23:12,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-19 01:23:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:13,222 INFO L225 Difference]: With dead ends: 33591 [2019-12-19 01:23:13,222 INFO L226 Difference]: Without dead ends: 25703 [2019-12-19 01:23:13,229 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 01:23:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-19 01:23:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-19 01:23:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-19 01:23:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-19 01:23:14,758 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-19 01:23:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:14,761 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-19 01:23:14,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-19 01:23:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 01:23:14,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:14,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:14,780 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash 471938879, now seen corresponding path program 1 times [2019-12-19 01:23:14,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:14,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089830756] [2019-12-19 01:23:14,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:14,938 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 01:23:14,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089830756] [2019-12-19 01:23:14,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:14,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:14,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132688045] [2019-12-19 01:23:14,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:14,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:14,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:14,942 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-19 01:23:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:15,820 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-19 01:23:15,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:15,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 01:23:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:17,292 INFO L225 Difference]: With dead ends: 41081 [2019-12-19 01:23:17,292 INFO L226 Difference]: Without dead ends: 40545 [2019-12-19 01:23:17,293 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 01:23:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-19 01:23:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-19 01:23:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-19 01:23:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-19 01:23:18,824 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-19 01:23:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:18,829 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-19 01:23:18,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-19 01:23:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 01:23:18,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:18,842 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 01:23:18,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1446923185, now seen corresponding path program 1 times [2019-12-19 01:23:18,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:18,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906233206] [2019-12-19 01:23:18,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:18,992 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 01:23:18,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906233206] [2019-12-19 01:23:18,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:18,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:18,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684565852] [2019-12-19 01:23:18,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:18,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:18,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:18,998 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-19 01:23:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:19,849 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-19 01:23:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:19,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 01:23:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:20,137 INFO L225 Difference]: With dead ends: 49778 [2019-12-19 01:23:20,138 INFO L226 Difference]: Without dead ends: 49274 [2019-12-19 01:23:20,138 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 01:23:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-19 01:23:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-19 01:23:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-19 01:23:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-19 01:23:23,038 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-19 01:23:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:23,038 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-19 01:23:23,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-19 01:23:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 01:23:23,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:23,048 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] [2019-12-19 01:23:23,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash -104992681, now seen corresponding path program 1 times [2019-12-19 01:23:23,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:23,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272307434] [2019-12-19 01:23:23,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:23,101 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 01:23:23,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272307434] [2019-12-19 01:23:23,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:23,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:23,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431989350] [2019-12-19 01:23:23,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:23,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:23,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:23,103 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-19 01:23:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:23,790 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-19 01:23:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:23,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-19 01:23:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:23,970 INFO L225 Difference]: With dead ends: 61087 [2019-12-19 01:23:23,971 INFO L226 Difference]: Without dead ends: 61087 [2019-12-19 01:23:23,971 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 01:23:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-19 01:23:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-19 01:23:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-19 01:23:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-19 01:23:26,944 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-19 01:23:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:26,945 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-19 01:23:26,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-19 01:23:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:26,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:26,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:26,961 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash -604414232, now seen corresponding path program 1 times [2019-12-19 01:23:26,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:26,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994301046] [2019-12-19 01:23:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:27,027 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 01:23:27,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994301046] [2019-12-19 01:23:27,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:27,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:27,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473080704] [2019-12-19 01:23:27,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:27,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:27,030 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 3 states. [2019-12-19 01:23:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:27,901 INFO L93 Difference]: Finished difference Result 53336 states and 193527 transitions. [2019-12-19 01:23:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:27,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 01:23:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:28,074 INFO L225 Difference]: With dead ends: 53336 [2019-12-19 01:23:28,074 INFO L226 Difference]: Without dead ends: 53336 [2019-12-19 01:23:28,075 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 01:23:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53336 states. [2019-12-19 01:23:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53336 to 50674. [2019-12-19 01:23:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50674 states. [2019-12-19 01:23:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50674 states to 50674 states and 183847 transitions. [2019-12-19 01:23:31,476 INFO L78 Accepts]: Start accepts. Automaton has 50674 states and 183847 transitions. Word has length 53 [2019-12-19 01:23:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:31,476 INFO L462 AbstractCegarLoop]: Abstraction has 50674 states and 183847 transitions. [2019-12-19 01:23:31,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 50674 states and 183847 transitions. [2019-12-19 01:23:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:31,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:31,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:31,492 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2118465688, now seen corresponding path program 1 times [2019-12-19 01:23:31,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:31,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400394099] [2019-12-19 01:23:31,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:31,625 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 01:23:31,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400394099] [2019-12-19 01:23:31,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:31,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:31,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501633153] [2019-12-19 01:23:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:31,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:31,628 INFO L87 Difference]: Start difference. First operand 50674 states and 183847 transitions. Second operand 6 states. [2019-12-19 01:23:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:32,565 INFO L93 Difference]: Finished difference Result 65266 states and 234905 transitions. [2019-12-19 01:23:32,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:32,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 01:23:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:32,710 INFO L225 Difference]: With dead ends: 65266 [2019-12-19 01:23:32,710 INFO L226 Difference]: Without dead ends: 65266 [2019-12-19 01:23:32,711 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 01:23:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65266 states. [2019-12-19 01:23:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65266 to 59949. [2019-12-19 01:23:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-19 01:23:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-19 01:23:34,340 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-19 01:23:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:34,341 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-19 01:23:34,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-19 01:23:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:34,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:34,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:34,360 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:34,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash 379550249, now seen corresponding path program 1 times [2019-12-19 01:23:34,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:34,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99483965] [2019-12-19 01:23:34,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:34,470 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 01:23:34,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99483965] [2019-12-19 01:23:34,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:34,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:23:34,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727026671] [2019-12-19 01:23:34,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:23:34,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:23:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:23:34,473 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-19 01:23:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:36,343 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-19 01:23:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 01:23:36,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-19 01:23:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:36,524 INFO L225 Difference]: With dead ends: 83685 [2019-12-19 01:23:36,525 INFO L226 Difference]: Without dead ends: 83685 [2019-12-19 01:23:36,525 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 01:23:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-19 01:23:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-19 01:23:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-19 01:23:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-19 01:23:40,327 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-19 01:23:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:40,328 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-19 01:23:40,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:23:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-19 01:23:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:40,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:40,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:40,341 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1267053930, now seen corresponding path program 1 times [2019-12-19 01:23:40,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:40,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189321332] [2019-12-19 01:23:40,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:40,435 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 01:23:40,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189321332] [2019-12-19 01:23:40,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:40,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:40,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409784965] [2019-12-19 01:23:40,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:40,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:40,438 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 5 states. [2019-12-19 01:23:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:40,523 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-12-19 01:23:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:23:40,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-19 01:23:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:40,540 INFO L225 Difference]: With dead ends: 12159 [2019-12-19 01:23:40,541 INFO L226 Difference]: Without dead ends: 10674 [2019-12-19 01:23:40,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 01:23:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-12-19 01:23:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-12-19 01:23:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-12-19 01:23:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-12-19 01:23:40,680 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-12-19 01:23:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:40,681 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-12-19 01:23:40,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-12-19 01:23:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:40,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:40,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:40,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2125589086, now seen corresponding path program 1 times [2019-12-19 01:23:40,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:40,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248468032] [2019-12-19 01:23:40,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:40,752 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 01:23:40,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248468032] [2019-12-19 01:23:40,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:40,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:40,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783890949] [2019-12-19 01:23:40,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:40,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:40,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:40,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:40,754 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-12-19 01:23:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:41,254 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-12-19 01:23:41,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 01:23:41,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 01:23:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:41,814 INFO L225 Difference]: With dead ends: 13182 [2019-12-19 01:23:41,814 INFO L226 Difference]: Without dead ends: 13119 [2019-12-19 01:23:41,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 01:23:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-12-19 01:23:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-12-19 01:23:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-12-19 01:23:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-12-19 01:23:41,988 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-12-19 01:23:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:41,988 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-12-19 01:23:41,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-12-19 01:23:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 01:23:41,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:41,992 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] [2019-12-19 01:23:41,992 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash 340486782, now seen corresponding path program 1 times [2019-12-19 01:23:41,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:41,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16616830] [2019-12-19 01:23:41,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:42,050 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 01:23:42,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16616830] [2019-12-19 01:23:42,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:42,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:42,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163702099] [2019-12-19 01:23:42,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:42,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:42,053 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-12-19 01:23:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:42,187 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-12-19 01:23:42,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:23:42,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-19 01:23:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:42,206 INFO L225 Difference]: With dead ends: 12862 [2019-12-19 01:23:42,206 INFO L226 Difference]: Without dead ends: 12862 [2019-12-19 01:23:42,206 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 01:23:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-12-19 01:23:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-12-19 01:23:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-12-19 01:23:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-12-19 01:23:42,370 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-12-19 01:23:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:42,370 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-12-19 01:23:42,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-12-19 01:23:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 01:23:42,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:42,376 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] [2019-12-19 01:23:42,376 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2083297117, now seen corresponding path program 1 times [2019-12-19 01:23:42,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:42,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138566932] [2019-12-19 01:23:42,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:42,456 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 01:23:42,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138566932] [2019-12-19 01:23:42,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:42,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:42,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505499856] [2019-12-19 01:23:42,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:42,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:42,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:42,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:42,458 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-12-19 01:23:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:42,960 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-12-19 01:23:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 01:23:42,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 01:23:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:42,983 INFO L225 Difference]: With dead ends: 14219 [2019-12-19 01:23:42,984 INFO L226 Difference]: Without dead ends: 14158 [2019-12-19 01:23:42,984 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 01:23:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-12-19 01:23:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-12-19 01:23:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-12-19 01:23:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-12-19 01:23:43,170 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-12-19 01:23:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:43,170 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-12-19 01:23:43,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-12-19 01:23:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 01:23:43,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:43,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:43,177 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1401730073, now seen corresponding path program 1 times [2019-12-19 01:23:43,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:43,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807046660] [2019-12-19 01:23:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:43,224 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 01:23:43,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807046660] [2019-12-19 01:23:43,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:43,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:43,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797937491] [2019-12-19 01:23:43,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:43,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:43,227 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-12-19 01:23:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:43,657 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-12-19 01:23:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:23:43,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 01:23:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:43,683 INFO L225 Difference]: With dead ends: 18895 [2019-12-19 01:23:43,683 INFO L226 Difference]: Without dead ends: 18847 [2019-12-19 01:23:43,684 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 01:23:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-12-19 01:23:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-12-19 01:23:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-12-19 01:23:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-12-19 01:23:43,896 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-12-19 01:23:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:43,896 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-12-19 01:23:43,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-12-19 01:23:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 01:23:43,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:43,903 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] [2019-12-19 01:23:43,904 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1648472742, now seen corresponding path program 1 times [2019-12-19 01:23:43,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:43,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963840256] [2019-12-19 01:23:43,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:44,354 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 01:23:44,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963840256] [2019-12-19 01:23:44,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:44,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:44,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246463745] [2019-12-19 01:23:44,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:44,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:44,356 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-12-19 01:23:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:44,685 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-12-19 01:23:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:23:44,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 01:23:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:44,710 INFO L225 Difference]: With dead ends: 18169 [2019-12-19 01:23:44,710 INFO L226 Difference]: Without dead ends: 18169 [2019-12-19 01:23:44,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-12-19 01:23:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-12-19 01:23:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-12-19 01:23:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-12-19 01:23:44,920 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-12-19 01:23:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:44,921 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-12-19 01:23:44,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-12-19 01:23:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 01:23:44,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:44,928 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] [2019-12-19 01:23:44,928 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:44,929 INFO L82 PathProgramCache]: Analyzing trace with hash -428736601, now seen corresponding path program 1 times [2019-12-19 01:23:44,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:44,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474024633] [2019-12-19 01:23:44,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:44,978 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 01:23:44,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474024633] [2019-12-19 01:23:44,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:44,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:44,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739610085] [2019-12-19 01:23:44,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:44,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:44,980 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-12-19 01:23:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:45,266 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-12-19 01:23:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:45,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-19 01:23:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:45,298 INFO L225 Difference]: With dead ends: 15542 [2019-12-19 01:23:45,298 INFO L226 Difference]: Without dead ends: 15542 [2019-12-19 01:23:45,299 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 01:23:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-12-19 01:23:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-12-19 01:23:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-12-19 01:23:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-12-19 01:23:45,553 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-12-19 01:23:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:45,554 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-12-19 01:23:45,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-12-19 01:23:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:23:45,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:45,562 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] [2019-12-19 01:23:45,562 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -812985011, now seen corresponding path program 1 times [2019-12-19 01:23:45,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:45,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150238220] [2019-12-19 01:23:45,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 01:23:45,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150238220] [2019-12-19 01:23:45,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:45,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:45,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190424407] [2019-12-19 01:23:45,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:45,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:45,685 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-12-19 01:23:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:46,152 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-12-19 01:23:46,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 01:23:46,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 01:23:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:46,176 INFO L225 Difference]: With dead ends: 16701 [2019-12-19 01:23:46,176 INFO L226 Difference]: Without dead ends: 16701 [2019-12-19 01:23:46,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 01:23:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-12-19 01:23:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-12-19 01:23:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-12-19 01:23:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-12-19 01:23:46,380 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-12-19 01:23:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:46,380 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-12-19 01:23:46,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-12-19 01:23:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:23:46,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:46,389 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] [2019-12-19 01:23:46,389 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:46,389 INFO L82 PathProgramCache]: Analyzing trace with hash -601634098, now seen corresponding path program 1 times [2019-12-19 01:23:46,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:46,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623130023] [2019-12-19 01:23:46,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:46,464 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 01:23:46,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623130023] [2019-12-19 01:23:46,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:46,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:46,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382205444] [2019-12-19 01:23:46,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:46,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:46,466 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-12-19 01:23:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:47,380 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-12-19 01:23:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:23:47,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 01:23:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:47,417 INFO L225 Difference]: With dead ends: 19681 [2019-12-19 01:23:47,417 INFO L226 Difference]: Without dead ends: 19681 [2019-12-19 01:23:47,417 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 01:23:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-12-19 01:23:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-12-19 01:23:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-12-19 01:23:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-12-19 01:23:47,758 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-12-19 01:23:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:47,758 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-12-19 01:23:47,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-12-19 01:23:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:23:47,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:47,769 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] [2019-12-19 01:23:47,769 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1112168275, now seen corresponding path program 1 times [2019-12-19 01:23:47,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:47,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350227152] [2019-12-19 01:23:47,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:47,840 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 01:23:47,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350227152] [2019-12-19 01:23:47,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:47,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:47,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294989989] [2019-12-19 01:23:47,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:47,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:47,842 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-12-19 01:23:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:48,405 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-12-19 01:23:48,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:48,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 01:23:48,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:48,455 INFO L225 Difference]: With dead ends: 26550 [2019-12-19 01:23:48,456 INFO L226 Difference]: Without dead ends: 26550 [2019-12-19 01:23:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 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 01:23:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-12-19 01:23:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-12-19 01:23:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-19 01:23:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-12-19 01:23:48,766 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-12-19 01:23:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:48,767 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-12-19 01:23:48,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-12-19 01:23:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:23:48,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:48,775 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] [2019-12-19 01:23:48,776 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1375344558, now seen corresponding path program 1 times [2019-12-19 01:23:48,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:48,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787727578] [2019-12-19 01:23:48,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:48,828 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 01:23:48,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787727578] [2019-12-19 01:23:48,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:48,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:48,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928152884] [2019-12-19 01:23:48,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:48,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:48,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:48,830 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 4 states. [2019-12-19 01:23:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:49,491 INFO L93 Difference]: Finished difference Result 28143 states and 82198 transitions. [2019-12-19 01:23:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:23:49,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 01:23:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:49,531 INFO L225 Difference]: With dead ends: 28143 [2019-12-19 01:23:49,532 INFO L226 Difference]: Without dead ends: 28008 [2019-12-19 01:23:49,532 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 01:23:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-12-19 01:23:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 26043. [2019-12-19 01:23:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2019-12-19 01:23:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 76088 transitions. [2019-12-19 01:23:50,352 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 76088 transitions. Word has length 67 [2019-12-19 01:23:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:50,353 INFO L462 AbstractCegarLoop]: Abstraction has 26043 states and 76088 transitions. [2019-12-19 01:23:50,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 76088 transitions. [2019-12-19 01:23:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:23:50,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:50,363 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] [2019-12-19 01:23:50,363 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash -421606801, now seen corresponding path program 1 times [2019-12-19 01:23:50,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:50,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733215447] [2019-12-19 01:23:50,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:50,456 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 01:23:50,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733215447] [2019-12-19 01:23:50,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:50,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:50,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345749518] [2019-12-19 01:23:50,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:50,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:50,458 INFO L87 Difference]: Start difference. First operand 26043 states and 76088 transitions. Second operand 5 states. [2019-12-19 01:23:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:50,518 INFO L93 Difference]: Finished difference Result 6987 states and 16662 transitions. [2019-12-19 01:23:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 01:23:50,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 01:23:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:50,525 INFO L225 Difference]: With dead ends: 6987 [2019-12-19 01:23:50,525 INFO L226 Difference]: Without dead ends: 5679 [2019-12-19 01:23:50,525 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 01:23:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2019-12-19 01:23:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 4422. [2019-12-19 01:23:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-19 01:23:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 10396 transitions. [2019-12-19 01:23:50,575 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 10396 transitions. Word has length 67 [2019-12-19 01:23:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:50,575 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 10396 transitions. [2019-12-19 01:23:50,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 10396 transitions. [2019-12-19 01:23:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:23:50,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:50,578 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] [2019-12-19 01:23:50,579 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2130159502, now seen corresponding path program 1 times [2019-12-19 01:23:50,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:50,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834141607] [2019-12-19 01:23:50,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:50,624 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 01:23:50,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834141607] [2019-12-19 01:23:50,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:50,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:50,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460349018] [2019-12-19 01:23:50,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:50,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:50,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:50,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:50,626 INFO L87 Difference]: Start difference. First operand 4422 states and 10396 transitions. Second operand 3 states. [2019-12-19 01:23:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:50,660 INFO L93 Difference]: Finished difference Result 5917 states and 13768 transitions. [2019-12-19 01:23:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:50,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 01:23:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:50,668 INFO L225 Difference]: With dead ends: 5917 [2019-12-19 01:23:50,669 INFO L226 Difference]: Without dead ends: 5917 [2019-12-19 01:23:50,669 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 01:23:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2019-12-19 01:23:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 4365. [2019-12-19 01:23:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-12-19 01:23:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 10043 transitions. [2019-12-19 01:23:50,735 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 10043 transitions. Word has length 67 [2019-12-19 01:23:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:50,736 INFO L462 AbstractCegarLoop]: Abstraction has 4365 states and 10043 transitions. [2019-12-19 01:23:50,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 10043 transitions. [2019-12-19 01:23:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 01:23:50,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:50,741 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] [2019-12-19 01:23:50,741 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash -347462239, now seen corresponding path program 1 times [2019-12-19 01:23:50,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:50,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856526142] [2019-12-19 01:23:50,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:50,806 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 01:23:50,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856526142] [2019-12-19 01:23:50,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:50,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:50,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921850649] [2019-12-19 01:23:50,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:50,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:50,809 INFO L87 Difference]: Start difference. First operand 4365 states and 10043 transitions. Second operand 5 states. [2019-12-19 01:23:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:50,988 INFO L93 Difference]: Finished difference Result 5332 states and 12274 transitions. [2019-12-19 01:23:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 01:23:50,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-19 01:23:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:50,996 INFO L225 Difference]: With dead ends: 5332 [2019-12-19 01:23:50,996 INFO L226 Difference]: Without dead ends: 5332 [2019-12-19 01:23:50,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 01:23:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2019-12-19 01:23:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 4751. [2019-12-19 01:23:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4751 states. [2019-12-19 01:23:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 10932 transitions. [2019-12-19 01:23:51,062 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 10932 transitions. Word has length 73 [2019-12-19 01:23:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 4751 states and 10932 transitions. [2019-12-19 01:23:51,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 10932 transitions. [2019-12-19 01:23:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 01:23:51,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:51,066 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] [2019-12-19 01:23:51,066 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1395348096, now seen corresponding path program 1 times [2019-12-19 01:23:51,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:51,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637823847] [2019-12-19 01:23:51,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 01:23:51,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637823847] [2019-12-19 01:23:51,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:51,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:23:51,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281190082] [2019-12-19 01:23:51,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:23:51,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:23:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:23:51,132 INFO L87 Difference]: Start difference. First operand 4751 states and 10932 transitions. Second operand 7 states. [2019-12-19 01:23:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:51,610 INFO L93 Difference]: Finished difference Result 5680 states and 12932 transitions. [2019-12-19 01:23:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 01:23:51,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-19 01:23:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:51,618 INFO L225 Difference]: With dead ends: 5680 [2019-12-19 01:23:51,618 INFO L226 Difference]: Without dead ends: 5627 [2019-12-19 01:23:51,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 01:23:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2019-12-19 01:23:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 4809. [2019-12-19 01:23:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4809 states. [2019-12-19 01:23:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 10981 transitions. [2019-12-19 01:23:51,669 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 10981 transitions. Word has length 73 [2019-12-19 01:23:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:51,669 INFO L462 AbstractCegarLoop]: Abstraction has 4809 states and 10981 transitions. [2019-12-19 01:23:51,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:23:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 10981 transitions. [2019-12-19 01:23:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 01:23:51,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:51,674 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] [2019-12-19 01:23:51,674 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -901640672, now seen corresponding path program 1 times [2019-12-19 01:23:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721176211] [2019-12-19 01:23:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:51,728 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 01:23:51,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721176211] [2019-12-19 01:23:51,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:51,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:51,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105367324] [2019-12-19 01:23:51,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:51,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:51,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:51,730 INFO L87 Difference]: Start difference. First operand 4809 states and 10981 transitions. Second operand 3 states. [2019-12-19 01:23:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:51,921 INFO L93 Difference]: Finished difference Result 6433 states and 14300 transitions. [2019-12-19 01:23:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:51,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-19 01:23:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:51,929 INFO L225 Difference]: With dead ends: 6433 [2019-12-19 01:23:51,929 INFO L226 Difference]: Without dead ends: 6142 [2019-12-19 01:23:51,930 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 01:23:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2019-12-19 01:23:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5643. [2019-12-19 01:23:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5643 states. [2019-12-19 01:23:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 12707 transitions. [2019-12-19 01:23:52,019 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 12707 transitions. Word has length 92 [2019-12-19 01:23:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:52,019 INFO L462 AbstractCegarLoop]: Abstraction has 5643 states and 12707 transitions. [2019-12-19 01:23:52,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 12707 transitions. [2019-12-19 01:23:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 01:23:52,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:52,027 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] [2019-12-19 01:23:52,028 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1251680806, now seen corresponding path program 1 times [2019-12-19 01:23:52,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:52,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281829592] [2019-12-19 01:23:52,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:52,115 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 01:23:52,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281829592] [2019-12-19 01:23:52,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:52,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:52,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246777934] [2019-12-19 01:23:52,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:52,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:52,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:52,118 INFO L87 Difference]: Start difference. First operand 5643 states and 12707 transitions. Second operand 4 states. [2019-12-19 01:23:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:52,223 INFO L93 Difference]: Finished difference Result 6001 states and 13550 transitions. [2019-12-19 01:23:52,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:23:52,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-19 01:23:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:52,231 INFO L225 Difference]: With dead ends: 6001 [2019-12-19 01:23:52,231 INFO L226 Difference]: Without dead ends: 6001 [2019-12-19 01:23:52,231 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 01:23:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2019-12-19 01:23:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5588. [2019-12-19 01:23:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5588 states. [2019-12-19 01:23:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 12666 transitions. [2019-12-19 01:23:52,337 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 12666 transitions. Word has length 92 [2019-12-19 01:23:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:52,337 INFO L462 AbstractCegarLoop]: Abstraction has 5588 states and 12666 transitions. [2019-12-19 01:23:52,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 12666 transitions. [2019-12-19 01:23:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:52,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:52,348 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] [2019-12-19 01:23:52,349 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1750155578, now seen corresponding path program 1 times [2019-12-19 01:23:52,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:52,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018190872] [2019-12-19 01:23:52,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:52,447 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 01:23:52,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018190872] [2019-12-19 01:23:52,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:52,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:52,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617985456] [2019-12-19 01:23:52,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:52,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:52,450 INFO L87 Difference]: Start difference. First operand 5588 states and 12666 transitions. Second operand 5 states. [2019-12-19 01:23:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:52,611 INFO L93 Difference]: Finished difference Result 6497 states and 14647 transitions. [2019-12-19 01:23:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:23:52,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 01:23:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:52,623 INFO L225 Difference]: With dead ends: 6497 [2019-12-19 01:23:52,623 INFO L226 Difference]: Without dead ends: 6497 [2019-12-19 01:23:52,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 01:23:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-12-19 01:23:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5002. [2019-12-19 01:23:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5002 states. [2019-12-19 01:23:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 11317 transitions. [2019-12-19 01:23:52,734 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 11317 transitions. Word has length 94 [2019-12-19 01:23:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:52,734 INFO L462 AbstractCegarLoop]: Abstraction has 5002 states and 11317 transitions. [2019-12-19 01:23:52,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 11317 transitions. [2019-12-19 01:23:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:52,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:52,741 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] [2019-12-19 01:23:52,741 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:52,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:52,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2004892123, now seen corresponding path program 1 times [2019-12-19 01:23:52,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:52,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558307683] [2019-12-19 01:23:52,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:52,799 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 01:23:52,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558307683] [2019-12-19 01:23:52,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:52,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:52,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625973461] [2019-12-19 01:23:52,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:52,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:52,802 INFO L87 Difference]: Start difference. First operand 5002 states and 11317 transitions. Second operand 5 states. [2019-12-19 01:23:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:53,289 INFO L93 Difference]: Finished difference Result 8089 states and 18313 transitions. [2019-12-19 01:23:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 01:23:53,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 01:23:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:53,298 INFO L225 Difference]: With dead ends: 8089 [2019-12-19 01:23:53,298 INFO L226 Difference]: Without dead ends: 8075 [2019-12-19 01:23:53,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 01:23:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2019-12-19 01:23:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 5781. [2019-12-19 01:23:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5781 states. [2019-12-19 01:23:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 13148 transitions. [2019-12-19 01:23:53,360 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 13148 transitions. Word has length 94 [2019-12-19 01:23:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:53,360 INFO L462 AbstractCegarLoop]: Abstraction has 5781 states and 13148 transitions. [2019-12-19 01:23:53,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 13148 transitions. [2019-12-19 01:23:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:53,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:53,368 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] [2019-12-19 01:23:53,368 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash -760127642, now seen corresponding path program 1 times [2019-12-19 01:23:53,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:53,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875841537] [2019-12-19 01:23:53,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:53,458 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 01:23:53,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875841537] [2019-12-19 01:23:53,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:53,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:53,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356346487] [2019-12-19 01:23:53,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:53,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:53,460 INFO L87 Difference]: Start difference. First operand 5781 states and 13148 transitions. Second operand 6 states. [2019-12-19 01:23:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:54,138 INFO L93 Difference]: Finished difference Result 7670 states and 17182 transitions. [2019-12-19 01:23:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 01:23:54,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 01:23:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:54,147 INFO L225 Difference]: With dead ends: 7670 [2019-12-19 01:23:54,147 INFO L226 Difference]: Without dead ends: 7670 [2019-12-19 01:23:54,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 01:23:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2019-12-19 01:23:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 5893. [2019-12-19 01:23:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5893 states. [2019-12-19 01:23:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 13284 transitions. [2019-12-19 01:23:54,214 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 13284 transitions. Word has length 94 [2019-12-19 01:23:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:54,214 INFO L462 AbstractCegarLoop]: Abstraction has 5893 states and 13284 transitions. [2019-12-19 01:23:54,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 13284 transitions. [2019-12-19 01:23:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:54,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:54,222 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] [2019-12-19 01:23:54,223 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:54,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2122986255, now seen corresponding path program 1 times [2019-12-19 01:23:54,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:54,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549059534] [2019-12-19 01:23:54,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:54,428 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 01:23:54,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549059534] [2019-12-19 01:23:54,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:54,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:23:54,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926026779] [2019-12-19 01:23:54,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:23:54,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:23:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:23:54,430 INFO L87 Difference]: Start difference. First operand 5893 states and 13284 transitions. Second operand 7 states. [2019-12-19 01:23:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:54,876 INFO L93 Difference]: Finished difference Result 7762 states and 17252 transitions. [2019-12-19 01:23:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 01:23:54,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-19 01:23:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:54,887 INFO L225 Difference]: With dead ends: 7762 [2019-12-19 01:23:54,887 INFO L226 Difference]: Without dead ends: 7664 [2019-12-19 01:23:54,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 01:23:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7664 states. [2019-12-19 01:23:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7664 to 6343. [2019-12-19 01:23:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6343 states. [2019-12-19 01:23:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 14227 transitions. [2019-12-19 01:23:54,953 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 14227 transitions. Word has length 94 [2019-12-19 01:23:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:54,953 INFO L462 AbstractCegarLoop]: Abstraction has 6343 states and 14227 transitions. [2019-12-19 01:23:54,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:23:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 14227 transitions. [2019-12-19 01:23:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:54,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:54,959 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] [2019-12-19 01:23:54,959 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1048393392, now seen corresponding path program 1 times [2019-12-19 01:23:54,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:54,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566251878] [2019-12-19 01:23:54,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:55,089 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 01:23:55,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566251878] [2019-12-19 01:23:55,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:55,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 01:23:55,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936503051] [2019-12-19 01:23:55,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 01:23:55,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 01:23:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-19 01:23:55,091 INFO L87 Difference]: Start difference. First operand 6343 states and 14227 transitions. Second operand 9 states. [2019-12-19 01:23:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:55,773 INFO L93 Difference]: Finished difference Result 8984 states and 20052 transitions. [2019-12-19 01:23:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 01:23:55,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-19 01:23:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:55,784 INFO L225 Difference]: With dead ends: 8984 [2019-12-19 01:23:55,785 INFO L226 Difference]: Without dead ends: 8966 [2019-12-19 01:23:55,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-19 01:23:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-12-19 01:23:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 7988. [2019-12-19 01:23:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7988 states. [2019-12-19 01:23:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7988 states to 7988 states and 17848 transitions. [2019-12-19 01:23:55,871 INFO L78 Accepts]: Start accepts. Automaton has 7988 states and 17848 transitions. Word has length 94 [2019-12-19 01:23:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:55,871 INFO L462 AbstractCegarLoop]: Abstraction has 7988 states and 17848 transitions. [2019-12-19 01:23:55,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 01:23:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7988 states and 17848 transitions. [2019-12-19 01:23:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:55,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:55,878 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] [2019-12-19 01:23:55,878 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash -748557967, now seen corresponding path program 1 times [2019-12-19 01:23:55,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:55,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351800308] [2019-12-19 01:23:55,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 01:23:55,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351800308] [2019-12-19 01:23:55,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:55,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 01:23:55,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473570820] [2019-12-19 01:23:55,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 01:23:55,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:55,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 01:23:55,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 01:23:55,988 INFO L87 Difference]: Start difference. First operand 7988 states and 17848 transitions. Second operand 8 states. [2019-12-19 01:23:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:56,474 INFO L93 Difference]: Finished difference Result 11261 states and 25318 transitions. [2019-12-19 01:23:56,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 01:23:56,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-19 01:23:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:56,488 INFO L225 Difference]: With dead ends: 11261 [2019-12-19 01:23:56,488 INFO L226 Difference]: Without dead ends: 11261 [2019-12-19 01:23:56,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 01:23:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11261 states. [2019-12-19 01:23:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11261 to 8323. [2019-12-19 01:23:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8323 states. [2019-12-19 01:23:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8323 states to 8323 states and 18699 transitions. [2019-12-19 01:23:56,592 INFO L78 Accepts]: Start accepts. Automaton has 8323 states and 18699 transitions. Word has length 94 [2019-12-19 01:23:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:56,593 INFO L462 AbstractCegarLoop]: Abstraction has 8323 states and 18699 transitions. [2019-12-19 01:23:56,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 01:23:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8323 states and 18699 transitions. [2019-12-19 01:23:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:56,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:56,600 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] [2019-12-19 01:23:56,601 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 138945714, now seen corresponding path program 1 times [2019-12-19 01:23:56,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:56,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133557373] [2019-12-19 01:23:56,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:56,708 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 01:23:56,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133557373] [2019-12-19 01:23:56,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:56,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:23:56,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820528259] [2019-12-19 01:23:56,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:23:56,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:23:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:23:56,710 INFO L87 Difference]: Start difference. First operand 8323 states and 18699 transitions. Second operand 7 states. [2019-12-19 01:23:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:56,880 INFO L93 Difference]: Finished difference Result 10478 states and 23417 transitions. [2019-12-19 01:23:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:23:56,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-19 01:23:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:56,890 INFO L225 Difference]: With dead ends: 10478 [2019-12-19 01:23:56,890 INFO L226 Difference]: Without dead ends: 10478 [2019-12-19 01:23:56,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 01:23:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10478 states. [2019-12-19 01:23:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10478 to 7735. [2019-12-19 01:23:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7735 states. [2019-12-19 01:23:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7735 states to 7735 states and 17260 transitions. [2019-12-19 01:23:56,980 INFO L78 Accepts]: Start accepts. Automaton has 7735 states and 17260 transitions. Word has length 94 [2019-12-19 01:23:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:56,981 INFO L462 AbstractCegarLoop]: Abstraction has 7735 states and 17260 transitions. [2019-12-19 01:23:56,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:23:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 7735 states and 17260 transitions. [2019-12-19 01:23:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:23:56,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:56,988 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] [2019-12-19 01:23:56,988 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1593029838, now seen corresponding path program 1 times [2019-12-19 01:23:56,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:56,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727314823] [2019-12-19 01:23:56,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 01:23:57,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727314823] [2019-12-19 01:23:57,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:57,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:57,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713958056] [2019-12-19 01:23:57,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:57,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:57,103 INFO L87 Difference]: Start difference. First operand 7735 states and 17260 transitions. Second operand 6 states. [2019-12-19 01:23:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:57,246 INFO L93 Difference]: Finished difference Result 7465 states and 16486 transitions. [2019-12-19 01:23:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:23:57,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 01:23:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:57,254 INFO L225 Difference]: With dead ends: 7465 [2019-12-19 01:23:57,254 INFO L226 Difference]: Without dead ends: 7465 [2019-12-19 01:23:57,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 01:23:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-12-19 01:23:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 4718. [2019-12-19 01:23:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4718 states. [2019-12-19 01:23:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 10474 transitions. [2019-12-19 01:23:57,314 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 10474 transitions. Word has length 94 [2019-12-19 01:23:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:57,315 INFO L462 AbstractCegarLoop]: Abstraction has 4718 states and 10474 transitions. [2019-12-19 01:23:57,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 10474 transitions. [2019-12-19 01:23:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:23:57,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:57,319 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] [2019-12-19 01:23:57,319 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 733241581, now seen corresponding path program 1 times [2019-12-19 01:23:57,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:57,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539954239] [2019-12-19 01:23:57,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:57,419 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 01:23:57,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539954239] [2019-12-19 01:23:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:57,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:57,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754557499] [2019-12-19 01:23:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:57,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:57,421 INFO L87 Difference]: Start difference. First operand 4718 states and 10474 transitions. Second operand 5 states. [2019-12-19 01:23:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:57,460 INFO L93 Difference]: Finished difference Result 4718 states and 10465 transitions. [2019-12-19 01:23:57,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:23:57,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 01:23:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:57,467 INFO L225 Difference]: With dead ends: 4718 [2019-12-19 01:23:57,468 INFO L226 Difference]: Without dead ends: 4718 [2019-12-19 01:23:57,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2019-12-19 01:23:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4718. [2019-12-19 01:23:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4718 states. [2019-12-19 01:23:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 10465 transitions. [2019-12-19 01:23:57,554 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 10465 transitions. Word has length 96 [2019-12-19 01:23:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:57,554 INFO L462 AbstractCegarLoop]: Abstraction has 4718 states and 10465 transitions. [2019-12-19 01:23:57,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 10465 transitions. [2019-12-19 01:23:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:23:57,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:57,563 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] [2019-12-19 01:23:57,563 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1620745262, now seen corresponding path program 1 times [2019-12-19 01:23:57,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:57,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731000584] [2019-12-19 01:23:57,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:58,016 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 01:23:58,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731000584] [2019-12-19 01:23:58,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:58,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 01:23:58,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147044041] [2019-12-19 01:23:58,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 01:23:58,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 01:23:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 01:23:58,018 INFO L87 Difference]: Start difference. First operand 4718 states and 10465 transitions. Second operand 10 states. [2019-12-19 01:23:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:58,483 INFO L93 Difference]: Finished difference Result 14876 states and 33451 transitions. [2019-12-19 01:23:58,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 01:23:58,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-19 01:23:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:58,501 INFO L225 Difference]: With dead ends: 14876 [2019-12-19 01:23:58,501 INFO L226 Difference]: Without dead ends: 10070 [2019-12-19 01:23:58,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 01:23:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10070 states. [2019-12-19 01:23:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10070 to 4739. [2019-12-19 01:23:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-19 01:23:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 10414 transitions. [2019-12-19 01:23:58,632 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 10414 transitions. Word has length 96 [2019-12-19 01:23:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:58,632 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 10414 transitions. [2019-12-19 01:23:58,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 01:23:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 10414 transitions. [2019-12-19 01:23:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:23:58,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:58,641 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] [2019-12-19 01:23:58,641 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -393959572, now seen corresponding path program 2 times [2019-12-19 01:23:58,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:58,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132241837] [2019-12-19 01:23:58,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 01:23:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 01:23:58,807 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 01:23:58,807 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 01:23:59,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:23:59 BasicIcfg [2019-12-19 01:23:59,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 01:23:59,028 INFO L168 Benchmark]: Toolchain (without parser) took 51928.52 ms. Allocated memory was 145.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 898.4 MB. Max. memory is 7.1 GB. [2019-12-19 01:23:59,028 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 01:23:59,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.43 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 157.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-19 01:23:59,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 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 01:23:59,030 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 01:23:59,030 INFO L168 Benchmark]: RCFGBuilder took 823.99 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 108.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-19 01:23:59,031 INFO L168 Benchmark]: TraceAbstraction took 50188.14 ms. Allocated memory was 202.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 107.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 847.2 MB. Max. memory is 7.1 GB. [2019-12-19 01:23:59,033 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.43 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 157.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.61 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 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 43.46 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.99 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 108.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50188.14 ms. Allocated memory was 202.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 107.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 847.2 MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 pthread_t t585; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=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] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 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)) [L768] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$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] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_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] [L774] 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) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_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] [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_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] [L778] 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 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 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) [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 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 [L812] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.7s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9205 SDtfs, 8955 SDslu, 20187 SDs, 0 SdLazy, 7441 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 98 SyntacticMatches, 18 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred 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: 22.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 89516 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2530 NumberOfCodeBlocks, 2530 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2400 ConstructedInterpolants, 0 QuantifiedInterpolants, 481413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...