/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:47:02,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:47:02,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:47:02,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:47:02,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:47:02,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:47:02,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:47:02,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:47:02,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:47:02,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:47:02,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:47:02,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:47:02,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:47:02,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:47:02,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:47:02,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:47:02,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:47:02,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:47:02,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:47:02,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:47:02,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:47:02,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:47:02,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:47:02,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:47:02,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:47:02,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:47:02,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:47:02,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:47:02,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:47:02,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:47:02,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:47:02,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:47:02,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:47:02,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:47:02,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:47:02,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:47:02,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:47:02,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:47:02,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:47:02,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:47:02,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:47:02,866 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-MCR.epf [2019-12-28 03:47:02,900 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:47:02,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:47:02,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:47:02,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:47:02,906 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:47:02,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:47:02,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:47:02,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:47:02,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:47:02,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:47:02,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:47:02,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:47:02,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:47:02,911 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:47:02,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:47:02,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:47:02,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:47:02,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:47:02,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:47:02,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:47:02,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:47:02,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:47:02,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:47:02,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:47:02,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:47:02,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:47:02,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:47:02,916 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:47:02,916 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:47:02,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:47:02,916 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:47:02,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:47:03,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:47:03,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:47:03,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:47:03,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:47:03,265 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:47:03,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-28 03:47:03,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f0038b3/b68087bc9df64122b33172dd4b9d0a16/FLAG38350736c [2019-12-28 03:47:03,832 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:47:03,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-28 03:47:03,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f0038b3/b68087bc9df64122b33172dd4b9d0a16/FLAG38350736c [2019-12-28 03:47:04,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f0038b3/b68087bc9df64122b33172dd4b9d0a16 [2019-12-28 03:47:04,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:47:04,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:47:04,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:47:04,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:47:04,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:47:04,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:47:04" (1/1) ... [2019-12-28 03:47:04,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24328a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:04, skipping insertion in model container [2019-12-28 03:47:04,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:47:04" (1/1) ... [2019-12-28 03:47:04,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:47:04,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:47:04,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:47:04,925 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:47:05,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:47:05,087 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:47:05,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05 WrapperNode [2019-12-28 03:47:05,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:47:05,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:47:05,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:47:05,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:47:05,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:47:05,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:47:05,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:47:05,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:47:05,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (1/1) ... [2019-12-28 03:47:05,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:47:05,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:47:05,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:47:05,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:47:05,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (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-28 03:47:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:47:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:47:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:47:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:47:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:47:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:47:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:47:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:47:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:47:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:47:05,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:47:05,287 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:47:06,009 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:47:06,009 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:47:06,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:47:06 BoogieIcfgContainer [2019-12-28 03:47:06,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:47:06,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:47:06,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:47:06,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:47:06,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:47:04" (1/3) ... [2019-12-28 03:47:06,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b25d37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:47:06, skipping insertion in model container [2019-12-28 03:47:06,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:05" (2/3) ... [2019-12-28 03:47:06,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b25d37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:47:06, skipping insertion in model container [2019-12-28 03:47:06,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:47:06" (3/3) ... [2019-12-28 03:47:06,019 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc.i [2019-12-28 03:47:06,029 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:47:06,030 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:47:06,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:47:06,038 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:47:06,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,076 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,104 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:06,161 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:47:06,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:47:06,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:47:06,181 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:47:06,181 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:47:06,181 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:47:06,182 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:47:06,182 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:47:06,182 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:47:06,200 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-28 03:47:07,719 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-28 03:47:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-28 03:47:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-28 03:47:07,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:07,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:07,731 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:07,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash -503711198, now seen corresponding path program 1 times [2019-12-28 03:47:07,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:07,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620266942] [2019-12-28 03:47:07,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:08,048 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-28 03:47:08,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620266942] [2019-12-28 03:47:08,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:08,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:08,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137891912] [2019-12-28 03:47:08,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:08,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:08,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-28 03:47:08,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:08,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:08,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:08,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:08,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:08,102 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-28 03:47:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:09,276 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-28 03:47:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:47:09,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-28 03:47:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:09,467 INFO L225 Difference]: With dead ends: 26617 [2019-12-28 03:47:09,467 INFO L226 Difference]: Without dead ends: 20361 [2019-12-28 03:47:09,469 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-28 03:47:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-28 03:47:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-28 03:47:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-28 03:47:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-28 03:47:10,567 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-28 03:47:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:10,567 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-28 03:47:10,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-28 03:47:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:47:10,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:10,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:10,581 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash -243116780, now seen corresponding path program 1 times [2019-12-28 03:47:10,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:10,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956106916] [2019-12-28 03:47:10,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:10,763 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-28 03:47:10,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956106916] [2019-12-28 03:47:10,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:10,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:10,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370157660] [2019-12-28 03:47:10,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:10,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:10,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:47:10,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:10,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:10,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:10,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:10,780 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-28 03:47:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:11,702 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-28 03:47:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:11,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 03:47:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:11,851 INFO L225 Difference]: With dead ends: 31839 [2019-12-28 03:47:11,851 INFO L226 Difference]: Without dead ends: 31287 [2019-12-28 03:47:11,852 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-28 03:47:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-28 03:47:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-28 03:47:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-28 03:47:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-28 03:47:14,126 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-28 03:47:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:14,128 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-28 03:47:14,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-28 03:47:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:47:14,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:14,139 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-28 03:47:14,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash -679798597, now seen corresponding path program 1 times [2019-12-28 03:47:14,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:14,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808839066] [2019-12-28 03:47:14,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:14,304 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-28 03:47:14,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808839066] [2019-12-28 03:47:14,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:14,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:14,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579913082] [2019-12-28 03:47:14,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:14,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:14,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-28 03:47:14,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:14,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:14,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:14,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:14,332 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-12-28 03:47:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:14,835 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-28 03:47:14,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:14,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 03:47:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:15,103 INFO L225 Difference]: With dead ends: 38697 [2019-12-28 03:47:15,103 INFO L226 Difference]: Without dead ends: 38249 [2019-12-28 03:47:15,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-28 03:47:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-28 03:47:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-28 03:47:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-28 03:47:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-28 03:47:18,097 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-28 03:47:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:18,097 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-28 03:47:18,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-28 03:47:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 03:47:18,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:18,105 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] [2019-12-28 03:47:18,105 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 360461205, now seen corresponding path program 1 times [2019-12-28 03:47:18,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:18,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042210896] [2019-12-28 03:47:18,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:18,164 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-28 03:47:18,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042210896] [2019-12-28 03:47:18,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:18,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:47:18,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532232134] [2019-12-28 03:47:18,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:18,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:18,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-28 03:47:18,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:18,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:18,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:47:18,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:47:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:18,190 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-12-28 03:47:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:18,404 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-28 03:47:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:47:18,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 03:47:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:18,531 INFO L225 Difference]: With dead ends: 42413 [2019-12-28 03:47:18,532 INFO L226 Difference]: Without dead ends: 42413 [2019-12-28 03:47:18,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 03:47:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-28 03:47:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-28 03:47:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-28 03:47:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-28 03:47:19,878 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-28 03:47:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:19,878 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-28 03:47:19,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:47:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-28 03:47:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:19,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:19,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:19,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1864507342, now seen corresponding path program 1 times [2019-12-28 03:47:19,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:19,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635795689] [2019-12-28 03:47:19,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:20,009 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-28 03:47:20,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635795689] [2019-12-28 03:47:20,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:20,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:20,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1702429688] [2019-12-28 03:47:20,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:20,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:20,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-28 03:47:20,042 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:20,144 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:47:20,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:20,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:20,146 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 8 states. [2019-12-28 03:47:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:21,222 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-28 03:47:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:47:21,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 03:47:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:21,515 INFO L225 Difference]: With dead ends: 48757 [2019-12-28 03:47:21,515 INFO L226 Difference]: Without dead ends: 48237 [2019-12-28 03:47:21,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:47:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-28 03:47:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-28 03:47:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-28 03:47:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-28 03:47:24,248 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-28 03:47:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:24,249 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-28 03:47:24,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-28 03:47:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:24,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:24,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:24,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2007106397, now seen corresponding path program 1 times [2019-12-28 03:47:24,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:24,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052674976] [2019-12-28 03:47:24,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:24,394 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-28 03:47:24,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052674976] [2019-12-28 03:47:24,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:24,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:24,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120248168] [2019-12-28 03:47:24,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:24,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:24,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:24,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:24,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:24,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:24,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:24,410 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-12-28 03:47:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:25,111 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-28 03:47:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:25,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 03:47:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:25,249 INFO L225 Difference]: With dead ends: 53006 [2019-12-28 03:47:25,249 INFO L226 Difference]: Without dead ends: 52030 [2019-12-28 03:47:25,249 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-28 03:47:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-28 03:47:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-28 03:47:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-28 03:47:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-28 03:47:26,583 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-28 03:47:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:26,583 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-28 03:47:26,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-28 03:47:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:26,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:26,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:26,603 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:26,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:26,603 INFO L82 PathProgramCache]: Analyzing trace with hash 490909540, now seen corresponding path program 1 times [2019-12-28 03:47:26,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:26,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485785131] [2019-12-28 03:47:26,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:27,151 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-28 03:47:27,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485785131] [2019-12-28 03:47:27,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:27,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:27,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439306988] [2019-12-28 03:47:27,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:27,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:27,167 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:27,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:27,168 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:27,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:27,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:27,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:27,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:27,170 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-12-28 03:47:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:28,428 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-28 03:47:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:28,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 03:47:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:28,574 INFO L225 Difference]: With dead ends: 70898 [2019-12-28 03:47:28,575 INFO L226 Difference]: Without dead ends: 70898 [2019-12-28 03:47:28,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-28 03:47:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-28 03:47:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-28 03:47:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-28 03:47:31,546 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-28 03:47:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:31,547 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-28 03:47:31,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-28 03:47:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:31,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:31,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:31,560 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1378413221, now seen corresponding path program 1 times [2019-12-28 03:47:31,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:31,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846393898] [2019-12-28 03:47:31,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:31,630 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-28 03:47:31,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846393898] [2019-12-28 03:47:31,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:31,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:47:31,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009032422] [2019-12-28 03:47:31,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:31,637 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:31,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:31,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:31,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:31,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:47:31,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:47:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:31,646 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-12-28 03:47:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:31,823 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-12-28 03:47:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:47:31,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-28 03:47:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:31,906 INFO L225 Difference]: With dead ends: 43857 [2019-12-28 03:47:31,906 INFO L226 Difference]: Without dead ends: 43353 [2019-12-28 03:47:31,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-12-28 03:47:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-12-28 03:47:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-12-28 03:47:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-12-28 03:47:33,114 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-12-28 03:47:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:33,114 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-12-28 03:47:33,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:47:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-12-28 03:47:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 03:47:33,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:33,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:33,125 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1658901394, now seen corresponding path program 1 times [2019-12-28 03:47:33,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:33,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286476140] [2019-12-28 03:47:33,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:33,219 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-28 03:47:33,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286476140] [2019-12-28 03:47:33,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:33,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:33,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901999601] [2019-12-28 03:47:33,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:33,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:33,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 03:47:33,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:33,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:33,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:33,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:33,240 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-12-28 03:47:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:34,019 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-12-28 03:47:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:34,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 03:47:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:34,123 INFO L225 Difference]: With dead ends: 54550 [2019-12-28 03:47:34,124 INFO L226 Difference]: Without dead ends: 54550 [2019-12-28 03:47:34,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-12-28 03:47:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-12-28 03:47:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-28 03:47:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-12-28 03:47:36,690 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-12-28 03:47:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:36,691 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-12-28 03:47:36,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-12-28 03:47:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 03:47:36,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:36,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:36,701 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash -771397713, now seen corresponding path program 1 times [2019-12-28 03:47:36,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:36,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555177950] [2019-12-28 03:47:36,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:36,783 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-28 03:47:36,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555177950] [2019-12-28 03:47:36,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:36,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:36,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043301376] [2019-12-28 03:47:36,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:36,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:36,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 03:47:36,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:36,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:36,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:36,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:36,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:36,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:36,798 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-12-28 03:47:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:36,858 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-12-28 03:47:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:36,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-28 03:47:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:36,871 INFO L225 Difference]: With dead ends: 8164 [2019-12-28 03:47:36,872 INFO L226 Difference]: Without dead ends: 6755 [2019-12-28 03:47:36,872 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-28 03:47:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-12-28 03:47:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-12-28 03:47:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-12-28 03:47:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-12-28 03:47:36,982 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-12-28 03:47:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:36,982 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-12-28 03:47:36,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-12-28 03:47:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:47:36,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:36,986 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-28 03:47:36,986 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 210347587, now seen corresponding path program 1 times [2019-12-28 03:47:36,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:36,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158583624] [2019-12-28 03:47:36,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:37,054 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-28 03:47:37,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158583624] [2019-12-28 03:47:37,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:37,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:37,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1246100970] [2019-12-28 03:47:37,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:37,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:37,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:47:37,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:37,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:37,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:37,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:37,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:37,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:37,099 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 4 states. [2019-12-28 03:47:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:37,229 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-12-28 03:47:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:37,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 03:47:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:37,244 INFO L225 Difference]: With dead ends: 7892 [2019-12-28 03:47:37,244 INFO L226 Difference]: Without dead ends: 7892 [2019-12-28 03:47:37,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:47:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-12-28 03:47:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-12-28 03:47:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-12-28 03:47:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-12-28 03:47:37,675 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-12-28 03:47:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:37,675 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-12-28 03:47:37,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-12-28 03:47:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:47:37,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:37,679 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-28 03:47:37,679 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1953157922, now seen corresponding path program 1 times [2019-12-28 03:47:37,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:37,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956244461] [2019-12-28 03:47:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:37,745 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-28 03:47:37,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956244461] [2019-12-28 03:47:37,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:37,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:37,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956294557] [2019-12-28 03:47:37,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:37,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:37,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:47:37,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:37,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:37,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:37,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:37,787 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 6 states. [2019-12-28 03:47:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:38,118 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-12-28 03:47:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:38,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-28 03:47:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:38,137 INFO L225 Difference]: With dead ends: 9269 [2019-12-28 03:47:38,138 INFO L226 Difference]: Without dead ends: 9221 [2019-12-28 03:47:38,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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-28 03:47:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-12-28 03:47:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-12-28 03:47:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-12-28 03:47:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-12-28 03:47:38,289 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-12-28 03:47:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:38,289 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-12-28 03:47:38,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-12-28 03:47:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:38,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:38,296 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] [2019-12-28 03:47:38,296 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2066677115, now seen corresponding path program 1 times [2019-12-28 03:47:38,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:38,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434434028] [2019-12-28 03:47:38,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:38,362 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-28 03:47:38,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434434028] [2019-12-28 03:47:38,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:38,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:38,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1485997814] [2019-12-28 03:47:38,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:38,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:38,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:38,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:38,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:38,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:38,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:38,389 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-12-28 03:47:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:38,615 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-12-28 03:47:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:47:38,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 03:47:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:38,634 INFO L225 Difference]: With dead ends: 10666 [2019-12-28 03:47:38,635 INFO L226 Difference]: Without dead ends: 10666 [2019-12-28 03:47:38,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-12-28 03:47:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-12-28 03:47:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-12-28 03:47:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-12-28 03:47:38,758 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-12-28 03:47:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:38,758 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-12-28 03:47:38,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-12-28 03:47:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:38,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:38,766 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] [2019-12-28 03:47:38,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -983525700, now seen corresponding path program 1 times [2019-12-28 03:47:38,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:38,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071443232] [2019-12-28 03:47:38,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:38,832 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-28 03:47:38,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071443232] [2019-12-28 03:47:38,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:38,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:38,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697444863] [2019-12-28 03:47:38,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:38,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:38,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:38,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:38,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:38,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:38,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:38,860 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-12-28 03:47:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:39,713 INFO L93 Difference]: Finished difference Result 17149 states and 50035 transitions. [2019-12-28 03:47:39,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:39,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:47:39,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:39,750 INFO L225 Difference]: With dead ends: 17149 [2019-12-28 03:47:39,750 INFO L226 Difference]: Without dead ends: 17149 [2019-12-28 03:47:39,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2019-12-28 03:47:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12308. [2019-12-28 03:47:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-28 03:47:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 35903 transitions. [2019-12-28 03:47:40,045 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 35903 transitions. Word has length 69 [2019-12-28 03:47:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:40,046 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 35903 transitions. [2019-12-28 03:47:40,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 35903 transitions. [2019-12-28 03:47:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:40,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:40,071 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] [2019-12-28 03:47:40,071 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1494059877, now seen corresponding path program 1 times [2019-12-28 03:47:40,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:40,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672780390] [2019-12-28 03:47:40,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:40,190 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-28 03:47:40,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672780390] [2019-12-28 03:47:40,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:40,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:40,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136372514] [2019-12-28 03:47:40,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:40,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:40,217 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:40,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:40,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:40,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:40,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:40,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:40,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:40,219 INFO L87 Difference]: Start difference. First operand 12308 states and 35903 transitions. Second operand 7 states. [2019-12-28 03:47:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:41,793 INFO L93 Difference]: Finished difference Result 17995 states and 52090 transitions. [2019-12-28 03:47:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 03:47:41,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 03:47:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:41,819 INFO L225 Difference]: With dead ends: 17995 [2019-12-28 03:47:41,819 INFO L226 Difference]: Without dead ends: 17638 [2019-12-28 03:47:41,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:47:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-28 03:47:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 15469. [2019-12-28 03:47:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15469 states. [2019-12-28 03:47:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15469 states to 15469 states and 45203 transitions. [2019-12-28 03:47:42,041 INFO L78 Accepts]: Start accepts. Automaton has 15469 states and 45203 transitions. Word has length 69 [2019-12-28 03:47:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:42,041 INFO L462 AbstractCegarLoop]: Abstraction has 15469 states and 45203 transitions. [2019-12-28 03:47:42,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15469 states and 45203 transitions. [2019-12-28 03:47:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:42,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:42,054 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] [2019-12-28 03:47:42,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1003956060, now seen corresponding path program 1 times [2019-12-28 03:47:42,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:42,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063606557] [2019-12-28 03:47:42,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:42,146 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-28 03:47:42,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063606557] [2019-12-28 03:47:42,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:42,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:42,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607320866] [2019-12-28 03:47:42,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:42,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:42,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:42,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:42,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:42,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:42,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:42,173 INFO L87 Difference]: Start difference. First operand 15469 states and 45203 transitions. Second operand 6 states. [2019-12-28 03:47:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:42,632 INFO L93 Difference]: Finished difference Result 15470 states and 44822 transitions. [2019-12-28 03:47:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:42,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:47:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:42,655 INFO L225 Difference]: With dead ends: 15470 [2019-12-28 03:47:42,655 INFO L226 Difference]: Without dead ends: 15470 [2019-12-28 03:47:42,655 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-28 03:47:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2019-12-28 03:47:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 15030. [2019-12-28 03:47:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15030 states. [2019-12-28 03:47:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15030 states to 15030 states and 43684 transitions. [2019-12-28 03:47:42,843 INFO L78 Accepts]: Start accepts. Automaton has 15030 states and 43684 transitions. Word has length 69 [2019-12-28 03:47:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:42,843 INFO L462 AbstractCegarLoop]: Abstraction has 15030 states and 43684 transitions. [2019-12-28 03:47:42,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15030 states and 43684 transitions. [2019-12-28 03:47:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:42,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:42,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:42,853 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1234232253, now seen corresponding path program 1 times [2019-12-28 03:47:42,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:42,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340284924] [2019-12-28 03:47:42,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:42,906 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-28 03:47:42,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340284924] [2019-12-28 03:47:42,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:42,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:42,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811566966] [2019-12-28 03:47:42,907 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:42,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:42,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:42,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:42,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:42,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:42,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:42,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:42,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:42,933 INFO L87 Difference]: Start difference. First operand 15030 states and 43684 transitions. Second operand 5 states. [2019-12-28 03:47:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:43,247 INFO L93 Difference]: Finished difference Result 19011 states and 54959 transitions. [2019-12-28 03:47:43,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:47:43,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:43,273 INFO L225 Difference]: With dead ends: 19011 [2019-12-28 03:47:43,273 INFO L226 Difference]: Without dead ends: 19011 [2019-12-28 03:47:43,274 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-28 03:47:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19011 states. [2019-12-28 03:47:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19011 to 16078. [2019-12-28 03:47:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-12-28 03:47:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 46402 transitions. [2019-12-28 03:47:43,487 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 46402 transitions. Word has length 69 [2019-12-28 03:47:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:43,487 INFO L462 AbstractCegarLoop]: Abstraction has 16078 states and 46402 transitions. [2019-12-28 03:47:43,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 46402 transitions. [2019-12-28 03:47:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:43,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:43,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:47:43,497 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:43,497 INFO L82 PathProgramCache]: Analyzing trace with hash 723698076, now seen corresponding path program 1 times [2019-12-28 03:47:43,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:43,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419011681] [2019-12-28 03:47:43,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:43,562 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-28 03:47:43,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419011681] [2019-12-28 03:47:43,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:43,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:43,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431866439] [2019-12-28 03:47:43,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:43,573 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:43,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:43,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:43,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:43,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:43,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:43,597 INFO L87 Difference]: Start difference. First operand 16078 states and 46402 transitions. Second operand 4 states. [2019-12-28 03:47:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:44,237 INFO L93 Difference]: Finished difference Result 19504 states and 56336 transitions. [2019-12-28 03:47:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:44,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 03:47:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:44,272 INFO L225 Difference]: With dead ends: 19504 [2019-12-28 03:47:44,273 INFO L226 Difference]: Without dead ends: 19129 [2019-12-28 03:47:44,273 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-28 03:47:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19129 states. [2019-12-28 03:47:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19129 to 15673. [2019-12-28 03:47:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2019-12-28 03:47:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 45021 transitions. [2019-12-28 03:47:44,689 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 45021 transitions. Word has length 69 [2019-12-28 03:47:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:44,689 INFO L462 AbstractCegarLoop]: Abstraction has 15673 states and 45021 transitions. [2019-12-28 03:47:44,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 45021 transitions. [2019-12-28 03:47:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:44,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:44,707 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] [2019-12-28 03:47:44,708 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1073253283, now seen corresponding path program 1 times [2019-12-28 03:47:44,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:44,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028169250] [2019-12-28 03:47:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:44,851 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-28 03:47:44,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028169250] [2019-12-28 03:47:44,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:44,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:44,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788350826] [2019-12-28 03:47:44,852 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:44,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:44,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:44,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:44,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:44,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:44,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:44,893 INFO L87 Difference]: Start difference. First operand 15673 states and 45021 transitions. Second operand 5 states. [2019-12-28 03:47:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:44,974 INFO L93 Difference]: Finished difference Result 5689 states and 14113 transitions. [2019-12-28 03:47:44,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:47:44,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:44,984 INFO L225 Difference]: With dead ends: 5689 [2019-12-28 03:47:44,985 INFO L226 Difference]: Without dead ends: 4781 [2019-12-28 03:47:44,985 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-28 03:47:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2019-12-28 03:47:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 3861. [2019-12-28 03:47:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2019-12-28 03:47:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 9489 transitions. [2019-12-28 03:47:45,073 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 9489 transitions. Word has length 69 [2019-12-28 03:47:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:45,073 INFO L462 AbstractCegarLoop]: Abstraction has 3861 states and 9489 transitions. [2019-12-28 03:47:45,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 9489 transitions. [2019-12-28 03:47:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:45,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:45,082 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] [2019-12-28 03:47:45,082 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1417025587, now seen corresponding path program 1 times [2019-12-28 03:47:45,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:45,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707090797] [2019-12-28 03:47:45,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:45,289 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-28 03:47:45,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707090797] [2019-12-28 03:47:45,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:45,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:45,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812132102] [2019-12-28 03:47:45,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:45,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:45,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:45,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:45,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:47:45,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:45,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:45,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:45,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:45,457 INFO L87 Difference]: Start difference. First operand 3861 states and 9489 transitions. Second operand 8 states. [2019-12-28 03:47:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:46,548 INFO L93 Difference]: Finished difference Result 5369 states and 12814 transitions. [2019-12-28 03:47:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:47:46,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 03:47:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:46,560 INFO L225 Difference]: With dead ends: 5369 [2019-12-28 03:47:46,560 INFO L226 Difference]: Without dead ends: 5321 [2019-12-28 03:47:46,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-12-28 03:47:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2019-12-28 03:47:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 4041. [2019-12-28 03:47:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4041 states. [2019-12-28 03:47:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 9875 transitions. [2019-12-28 03:47:46,663 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 9875 transitions. Word has length 86 [2019-12-28 03:47:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:46,663 INFO L462 AbstractCegarLoop]: Abstraction has 4041 states and 9875 transitions. [2019-12-28 03:47:46,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 9875 transitions. [2019-12-28 03:47:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:46,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:46,671 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] [2019-12-28 03:47:46,671 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1186749394, now seen corresponding path program 1 times [2019-12-28 03:47:46,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:46,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758287374] [2019-12-28 03:47:46,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:46,803 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-28 03:47:46,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758287374] [2019-12-28 03:47:46,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:46,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:46,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [809812925] [2019-12-28 03:47:46,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:46,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:46,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 292 transitions. [2019-12-28 03:47:46,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:46,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:47:46,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:46,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:46,970 INFO L87 Difference]: Start difference. First operand 4041 states and 9875 transitions. Second operand 7 states. [2019-12-28 03:47:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:47,603 INFO L93 Difference]: Finished difference Result 6098 states and 14493 transitions. [2019-12-28 03:47:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 03:47:47,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 03:47:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:47,613 INFO L225 Difference]: With dead ends: 6098 [2019-12-28 03:47:47,613 INFO L226 Difference]: Without dead ends: 6098 [2019-12-28 03:47:47,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:47:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2019-12-28 03:47:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 4073. [2019-12-28 03:47:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4073 states. [2019-12-28 03:47:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 9945 transitions. [2019-12-28 03:47:47,694 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 9945 transitions. Word has length 86 [2019-12-28 03:47:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:47,694 INFO L462 AbstractCegarLoop]: Abstraction has 4073 states and 9945 transitions. [2019-12-28 03:47:47,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 9945 transitions. [2019-12-28 03:47:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:47,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:47,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:47:47,702 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 800732366, now seen corresponding path program 1 times [2019-12-28 03:47:47,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:47,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129302228] [2019-12-28 03:47:47,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:47,817 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-28 03:47:47,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129302228] [2019-12-28 03:47:47,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:47,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:47,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [642878482] [2019-12-28 03:47:47,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:47,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:47,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:47,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:48,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:47:48,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:48,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:48,026 INFO L87 Difference]: Start difference. First operand 4073 states and 9945 transitions. Second operand 6 states. [2019-12-28 03:47:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:48,114 INFO L93 Difference]: Finished difference Result 4028 states and 9813 transitions. [2019-12-28 03:47:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:47:48,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-28 03:47:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:48,122 INFO L225 Difference]: With dead ends: 4028 [2019-12-28 03:47:48,122 INFO L226 Difference]: Without dead ends: 4028 [2019-12-28 03:47:48,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2019-12-28 03:47:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 2893. [2019-12-28 03:47:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-28 03:47:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6871 transitions. [2019-12-28 03:47:48,189 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6871 transitions. Word has length 86 [2019-12-28 03:47:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:48,190 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6871 transitions. [2019-12-28 03:47:48,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6871 transitions. [2019-12-28 03:47:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:48,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:48,196 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] [2019-12-28 03:47:48,196 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1688236047, now seen corresponding path program 1 times [2019-12-28 03:47:48,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:48,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903365346] [2019-12-28 03:47:48,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:48,331 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-28 03:47:48,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903365346] [2019-12-28 03:47:48,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:48,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:48,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041944838] [2019-12-28 03:47:48,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:48,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:48,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:48,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:48,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:47:48,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:48,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:48,460 INFO L87 Difference]: Start difference. First operand 2893 states and 6871 transitions. Second operand 8 states. [2019-12-28 03:47:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:48,578 INFO L93 Difference]: Finished difference Result 4760 states and 11425 transitions. [2019-12-28 03:47:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:47:48,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 03:47:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:48,583 INFO L225 Difference]: With dead ends: 4760 [2019-12-28 03:47:48,583 INFO L226 Difference]: Without dead ends: 1938 [2019-12-28 03:47:48,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2019-12-28 03:47:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1911. [2019-12-28 03:47:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-12-28 03:47:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 4605 transitions. [2019-12-28 03:47:48,604 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 4605 transitions. Word has length 86 [2019-12-28 03:47:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:48,604 INFO L462 AbstractCegarLoop]: Abstraction has 1911 states and 4605 transitions. [2019-12-28 03:47:48,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 4605 transitions. [2019-12-28 03:47:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:48,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:48,606 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] [2019-12-28 03:47:48,606 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash -419141643, now seen corresponding path program 1 times [2019-12-28 03:47:48,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:48,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906028462] [2019-12-28 03:47:48,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:48,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906028462] [2019-12-28 03:47:48,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:48,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:48,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1461113821] [2019-12-28 03:47:48,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:48,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:48,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 03:47:48,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:48,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:47:48,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:48,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:48,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:48,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:48,778 INFO L87 Difference]: Start difference. First operand 1911 states and 4605 transitions. Second operand 7 states. [2019-12-28 03:47:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:49,549 INFO L93 Difference]: Finished difference Result 2790 states and 6379 transitions. [2019-12-28 03:47:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:47:49,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 03:47:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:49,554 INFO L225 Difference]: With dead ends: 2790 [2019-12-28 03:47:49,554 INFO L226 Difference]: Without dead ends: 2768 [2019-12-28 03:47:49,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2019-12-28 03:47:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 1908. [2019-12-28 03:47:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-12-28 03:47:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 4432 transitions. [2019-12-28 03:47:49,577 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 4432 transitions. Word has length 86 [2019-12-28 03:47:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:49,578 INFO L462 AbstractCegarLoop]: Abstraction has 1908 states and 4432 transitions. [2019-12-28 03:47:49,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 4432 transitions. [2019-12-28 03:47:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:49,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:49,580 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] [2019-12-28 03:47:49,580 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash 273960054, now seen corresponding path program 1 times [2019-12-28 03:47:49,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:49,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267724052] [2019-12-28 03:47:49,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:49,662 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-28 03:47:49,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267724052] [2019-12-28 03:47:49,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:49,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:49,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1396023791] [2019-12-28 03:47:49,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:49,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:49,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 03:47:49,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:49,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:49,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:49,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:49,742 INFO L87 Difference]: Start difference. First operand 1908 states and 4432 transitions. Second operand 6 states. [2019-12-28 03:47:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:50,062 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-28 03:47:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:47:50,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-28 03:47:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:50,066 INFO L225 Difference]: With dead ends: 2123 [2019-12-28 03:47:50,067 INFO L226 Difference]: Without dead ends: 2123 [2019-12-28 03:47:50,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-28 03:47:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1850. [2019-12-28 03:47:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-12-28 03:47:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 4314 transitions. [2019-12-28 03:47:50,086 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 4314 transitions. Word has length 86 [2019-12-28 03:47:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:50,087 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 4314 transitions. [2019-12-28 03:47:50,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 4314 transitions. [2019-12-28 03:47:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:50,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:50,089 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] [2019-12-28 03:47:50,089 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1531956149, now seen corresponding path program 2 times [2019-12-28 03:47:50,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:50,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730724084] [2019-12-28 03:47:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:50,236 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-28 03:47:50,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730724084] [2019-12-28 03:47:50,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:50,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:47:50,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880372994] [2019-12-28 03:47:50,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:50,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:50,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 03:47:50,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:50,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:50,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:47:50,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:47:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:50,317 INFO L87 Difference]: Start difference. First operand 1850 states and 4314 transitions. Second operand 10 states. [2019-12-28 03:47:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:50,641 INFO L93 Difference]: Finished difference Result 3127 states and 7202 transitions. [2019-12-28 03:47:50,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:47:50,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-28 03:47:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:50,645 INFO L225 Difference]: With dead ends: 3127 [2019-12-28 03:47:50,645 INFO L226 Difference]: Without dead ends: 2083 [2019-12-28 03:47:50,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:47:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-12-28 03:47:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1915. [2019-12-28 03:47:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-12-28 03:47:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 4399 transitions. [2019-12-28 03:47:50,665 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 4399 transitions. Word has length 86 [2019-12-28 03:47:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:50,665 INFO L462 AbstractCegarLoop]: Abstraction has 1915 states and 4399 transitions. [2019-12-28 03:47:50,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:47:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 4399 transitions. [2019-12-28 03:47:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:50,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:50,667 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] [2019-12-28 03:47:50,668 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash 167637331, now seen corresponding path program 3 times [2019-12-28 03:47:50,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:50,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450285032] [2019-12-28 03:47:50,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:47:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:47:50,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:47:50,740 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:47:50,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:47:50 BasicIcfg [2019-12-28 03:47:50,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:47:50,915 INFO L168 Benchmark]: Toolchain (without parser) took 46722.77 ms. Allocated memory was 139.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 102.3 MB in the beginning and 644.7 MB in the end (delta: -542.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,916 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.99 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.1 MB in the beginning and 159.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.16 ms. Allocated memory is still 204.5 MB. Free memory was 159.1 MB in the beginning and 156.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,917 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,918 INFO L168 Benchmark]: RCFGBuilder took 821.23 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 112.7 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,918 INFO L168 Benchmark]: TraceAbstraction took 44900.42 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 112.7 MB in the beginning and 644.7 MB in the end (delta: -532.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,921 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 894.99 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.1 MB in the beginning and 159.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.16 ms. Allocated memory is still 204.5 MB. Free memory was 159.1 MB in the beginning and 156.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.23 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 112.7 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44900.42 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 112.7 MB in the beginning and 644.7 MB in the end (delta: -532.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1661; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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, z=0] [L803] 0 pthread_t t1662; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L812] 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 [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 44.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7123 SDtfs, 8491 SDslu, 17666 SDs, 0 SdLazy, 7415 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 95 SyntacticMatches, 13 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred 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: 21.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 72051 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 294585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...