/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/mix031_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:55:15,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:55:15,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:55:15,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:55:15,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:55:15,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:55:15,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:55:15,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:55:15,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:55:15,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:55:15,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:55:15,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:55:15,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:55:15,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:55:15,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:55:15,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:55:15,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:55:15,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:55:15,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:55:15,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:55:15,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:55:15,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:55:15,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:55:15,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:55:15,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:55:15,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:55:15,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:55:15,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:55:15,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:55:15,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:55:15,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:55:15,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:55:15,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:55:15,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:55:15,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:55:15,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:55:15,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:55:15,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:55:15,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:55:15,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:55:15,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:55:15,954 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 01:55:15,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:55:15,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:55:15,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:55:15,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:55:15,976 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:55:15,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:55:15,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:55:15,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:55:15,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:55:15,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:55:15,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:55:15,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:55:15,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:55:15,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:55:15,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:55:15,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:55:15,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:55:15,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:55:15,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:55:15,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:55:15,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:55:15,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:55:15,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:55:15,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:55:15,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:55:15,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:55:15,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:55:15,981 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:55:15,982 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:55:15,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:55:15,983 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:55:15,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:55:16,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:55:16,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:55:16,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:55:16,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:55:16,311 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:55:16,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-28 01:55:16,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276115f01/f75e2d0c7a4542869469f488709a7e5c/FLAG0cf2f89a5 [2019-12-28 01:55:16,972 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:55:16,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-28 01:55:16,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276115f01/f75e2d0c7a4542869469f488709a7e5c/FLAG0cf2f89a5 [2019-12-28 01:55:17,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276115f01/f75e2d0c7a4542869469f488709a7e5c [2019-12-28 01:55:17,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:55:17,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:55:17,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:17,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:55:17,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:55:17,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:17" (1/1) ... [2019-12-28 01:55:17,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db1bd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:17, skipping insertion in model container [2019-12-28 01:55:17,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:17" (1/1) ... [2019-12-28 01:55:17,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:55:17,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:55:17,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:17,853 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:55:17,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:18,033 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:55:18,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18 WrapperNode [2019-12-28 01:55:18,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:18,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:18,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:55:18,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:55:18,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:18,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:55:18,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:55:18,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:55:18,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (1/1) ... [2019-12-28 01:55:18,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:55:18,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:55:18,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:55:18,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:55:18,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (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 01:55:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:55:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:55:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:55:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:55:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:55:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:55:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:55:18,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:55:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:55:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:55:18,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:55:18,220 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 01:55:18,897 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:55:18,898 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:55:18,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:18 BoogieIcfgContainer [2019-12-28 01:55:18,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:55:18,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:55:18,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:55:18,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:55:18,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:55:17" (1/3) ... [2019-12-28 01:55:18,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263ff5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:18, skipping insertion in model container [2019-12-28 01:55:18,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:18" (2/3) ... [2019-12-28 01:55:18,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263ff5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:18, skipping insertion in model container [2019-12-28 01:55:18,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:18" (3/3) ... [2019-12-28 01:55:18,910 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-12-28 01:55:18,921 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:55:18,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:55:18,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:55:18,934 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:55:18,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:18,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,053 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,056 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:19,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:55:19,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:55:19,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:55:19,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:55:19,092 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:55:19,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:55:19,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:55:19,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:55:19,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:55:19,112 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 185 transitions [2019-12-28 01:55:20,977 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32595 states. [2019-12-28 01:55:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32595 states. [2019-12-28 01:55:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 01:55:20,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:20,993 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] [2019-12-28 01:55:20,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1631155360, now seen corresponding path program 1 times [2019-12-28 01:55:21,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:21,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620502572] [2019-12-28 01:55:21,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:21,321 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 01:55:21,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620502572] [2019-12-28 01:55:21,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:21,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:21,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251659818] [2019-12-28 01:55:21,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:21,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:21,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 01:55:21,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:21,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:21,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:21,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:21,372 INFO L87 Difference]: Start difference. First operand 32595 states. Second operand 4 states. [2019-12-28 01:55:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:22,917 INFO L93 Difference]: Finished difference Result 33595 states and 129572 transitions. [2019-12-28 01:55:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:22,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-28 01:55:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:23,171 INFO L225 Difference]: With dead ends: 33595 [2019-12-28 01:55:23,172 INFO L226 Difference]: Without dead ends: 25707 [2019-12-28 01:55:23,175 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 01:55:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2019-12-28 01:55:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2019-12-28 01:55:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-12-28 01:55:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 99588 transitions. [2019-12-28 01:55:24,872 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 99588 transitions. Word has length 38 [2019-12-28 01:55:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:24,872 INFO L462 AbstractCegarLoop]: Abstraction has 25707 states and 99588 transitions. [2019-12-28 01:55:24,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 99588 transitions. [2019-12-28 01:55:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:55:24,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:24,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:24,882 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 475633161, now seen corresponding path program 1 times [2019-12-28 01:55:24,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:24,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323189942] [2019-12-28 01:55:24,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:25,039 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 01:55:25,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323189942] [2019-12-28 01:55:25,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:25,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:25,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123950715] [2019-12-28 01:55:25,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:25,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:25,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:55:25,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:25,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:25,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:25,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:25,060 INFO L87 Difference]: Start difference. First operand 25707 states and 99588 transitions. Second operand 5 states. [2019-12-28 01:55:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:26,016 INFO L93 Difference]: Finished difference Result 41085 states and 150435 transitions. [2019-12-28 01:55:26,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:26,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 01:55:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:27,573 INFO L225 Difference]: With dead ends: 41085 [2019-12-28 01:55:27,574 INFO L226 Difference]: Without dead ends: 40549 [2019-12-28 01:55:27,575 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 01:55:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-28 01:55:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 38929. [2019-12-28 01:55:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38929 states. [2019-12-28 01:55:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38929 states to 38929 states and 143585 transitions. [2019-12-28 01:55:28,875 INFO L78 Accepts]: Start accepts. Automaton has 38929 states and 143585 transitions. Word has length 50 [2019-12-28 01:55:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:28,876 INFO L462 AbstractCegarLoop]: Abstraction has 38929 states and 143585 transitions. [2019-12-28 01:55:28,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38929 states and 143585 transitions. [2019-12-28 01:55:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 01:55:28,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:28,883 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 01:55:28,883 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:28,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1647317549, now seen corresponding path program 1 times [2019-12-28 01:55:28,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:28,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851711450] [2019-12-28 01:55:28,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:29,004 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 01:55:29,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851711450] [2019-12-28 01:55:29,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:29,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:29,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [651288192] [2019-12-28 01:55:29,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:29,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:29,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-28 01:55:29,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:29,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:29,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:29,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:29,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:29,020 INFO L87 Difference]: Start difference. First operand 38929 states and 143585 transitions. Second operand 5 states. [2019-12-28 01:55:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:29,917 INFO L93 Difference]: Finished difference Result 49782 states and 180637 transitions. [2019-12-28 01:55:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:29,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-28 01:55:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:30,072 INFO L225 Difference]: With dead ends: 49782 [2019-12-28 01:55:30,073 INFO L226 Difference]: Without dead ends: 49278 [2019-12-28 01:55:30,073 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 01:55:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-28 01:55:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 42681. [2019-12-28 01:55:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42681 states. [2019-12-28 01:55:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42681 states to 42681 states and 156596 transitions. [2019-12-28 01:55:33,026 INFO L78 Accepts]: Start accepts. Automaton has 42681 states and 156596 transitions. Word has length 51 [2019-12-28 01:55:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:33,029 INFO L462 AbstractCegarLoop]: Abstraction has 42681 states and 156596 transitions. [2019-12-28 01:55:33,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42681 states and 156596 transitions. [2019-12-28 01:55:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:55:33,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:33,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:33,042 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1552968967, now seen corresponding path program 1 times [2019-12-28 01:55:33,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:33,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541052471] [2019-12-28 01:55:33,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:33,143 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 01:55:33,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541052471] [2019-12-28 01:55:33,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:33,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:33,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166832501] [2019-12-28 01:55:33,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:33,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:33,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 01:55:33,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:33,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:33,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:33,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:33,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:33,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:33,162 INFO L87 Difference]: Start difference. First operand 42681 states and 156596 transitions. Second operand 3 states. [2019-12-28 01:55:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:33,772 INFO L93 Difference]: Finished difference Result 61091 states and 221434 transitions. [2019-12-28 01:55:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:33,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 01:55:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:33,964 INFO L225 Difference]: With dead ends: 61091 [2019-12-28 01:55:33,964 INFO L226 Difference]: Without dead ends: 61091 [2019-12-28 01:55:33,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61091 states. [2019-12-28 01:55:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61091 to 48020. [2019-12-28 01:55:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48020 states. [2019-12-28 01:55:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48020 states to 48020 states and 174183 transitions. [2019-12-28 01:55:36,822 INFO L78 Accepts]: Start accepts. Automaton has 48020 states and 174183 transitions. Word has length 53 [2019-12-28 01:55:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:36,822 INFO L462 AbstractCegarLoop]: Abstraction has 48020 states and 174183 transitions. [2019-12-28 01:55:36,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 48020 states and 174183 transitions. [2019-12-28 01:55:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:36,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:36,841 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] [2019-12-28 01:55:36,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:36,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1347337287, now seen corresponding path program 1 times [2019-12-28 01:55:36,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:36,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916179224] [2019-12-28 01:55:36,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:36,980 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 01:55:36,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916179224] [2019-12-28 01:55:36,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:36,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:36,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862282822] [2019-12-28 01:55:36,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:36,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:36,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 69 transitions. [2019-12-28 01:55:36,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:37,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:37,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:37,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:37,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:37,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:37,073 INFO L87 Difference]: Start difference. First operand 48020 states and 174183 transitions. Second operand 7 states. [2019-12-28 01:55:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:38,492 INFO L93 Difference]: Finished difference Result 63760 states and 229383 transitions. [2019-12-28 01:55:38,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:38,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-28 01:55:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:38,784 INFO L225 Difference]: With dead ends: 63760 [2019-12-28 01:55:38,784 INFO L226 Difference]: Without dead ends: 63760 [2019-12-28 01:55:38,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63760 states. [2019-12-28 01:55:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63760 to 59953. [2019-12-28 01:55:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59953 states. [2019-12-28 01:55:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59953 states to 59953 states and 215676 transitions. [2019-12-28 01:55:42,357 INFO L78 Accepts]: Start accepts. Automaton has 59953 states and 215676 transitions. Word has length 57 [2019-12-28 01:55:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:42,357 INFO L462 AbstractCegarLoop]: Abstraction has 59953 states and 215676 transitions. [2019-12-28 01:55:42,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 59953 states and 215676 transitions. [2019-12-28 01:55:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:42,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:42,387 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] [2019-12-28 01:55:42,387 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1150678650, now seen corresponding path program 1 times [2019-12-28 01:55:42,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:42,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324108329] [2019-12-28 01:55:42,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:42,494 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 01:55:42,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324108329] [2019-12-28 01:55:42,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:42,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:42,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379283364] [2019-12-28 01:55:42,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:42,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:42,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 69 transitions. [2019-12-28 01:55:42,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:42,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:42,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:42,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:42,535 INFO L87 Difference]: Start difference. First operand 59953 states and 215676 transitions. Second operand 8 states. [2019-12-28 01:55:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:44,406 INFO L93 Difference]: Finished difference Result 83689 states and 290101 transitions. [2019-12-28 01:55:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:55:44,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:55:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:44,626 INFO L225 Difference]: With dead ends: 83689 [2019-12-28 01:55:44,626 INFO L226 Difference]: Without dead ends: 83689 [2019-12-28 01:55:44,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:55:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83689 states. [2019-12-28 01:55:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83689 to 71016. [2019-12-28 01:55:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71016 states. [2019-12-28 01:55:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71016 states to 71016 states and 249890 transitions. [2019-12-28 01:55:48,307 INFO L78 Accepts]: Start accepts. Automaton has 71016 states and 249890 transitions. Word has length 57 [2019-12-28 01:55:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:48,308 INFO L462 AbstractCegarLoop]: Abstraction has 71016 states and 249890 transitions. [2019-12-28 01:55:48,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 71016 states and 249890 transitions. [2019-12-28 01:55:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:48,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:48,327 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] [2019-12-28 01:55:48,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2038182331, now seen corresponding path program 1 times [2019-12-28 01:55:48,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:48,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219617166] [2019-12-28 01:55:48,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:48,406 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 01:55:48,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219617166] [2019-12-28 01:55:48,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:48,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:48,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657179547] [2019-12-28 01:55:48,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:48,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:48,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 69 transitions. [2019-12-28 01:55:48,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:48,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:48,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:48,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:48,427 INFO L87 Difference]: Start difference. First operand 71016 states and 249890 transitions. Second operand 3 states. [2019-12-28 01:55:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:48,700 INFO L93 Difference]: Finished difference Result 54025 states and 188922 transitions. [2019-12-28 01:55:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:48,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-28 01:55:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:48,811 INFO L225 Difference]: With dead ends: 54025 [2019-12-28 01:55:48,812 INFO L226 Difference]: Without dead ends: 54025 [2019-12-28 01:55:48,812 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 01:55:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54025 states. [2019-12-28 01:55:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54025 to 53410. [2019-12-28 01:55:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53410 states. [2019-12-28 01:55:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 187041 transitions. [2019-12-28 01:55:50,246 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 187041 transitions. Word has length 57 [2019-12-28 01:55:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:50,247 INFO L462 AbstractCegarLoop]: Abstraction has 53410 states and 187041 transitions. [2019-12-28 01:55:50,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 187041 transitions. [2019-12-28 01:55:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:50,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:50,255 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] [2019-12-28 01:55:50,256 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -565356220, now seen corresponding path program 1 times [2019-12-28 01:55:50,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:50,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589183276] [2019-12-28 01:55:50,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:50,342 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 01:55:50,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589183276] [2019-12-28 01:55:50,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:50,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:50,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800815903] [2019-12-28 01:55:50,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:50,350 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:50,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 01:55:50,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:50,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:50,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:50,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:50,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:50,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:50,359 INFO L87 Difference]: Start difference. First operand 53410 states and 187041 transitions. Second operand 6 states. [2019-12-28 01:55:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:51,070 INFO L93 Difference]: Finished difference Result 68650 states and 237305 transitions. [2019-12-28 01:55:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:55:51,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-28 01:55:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:53,453 INFO L225 Difference]: With dead ends: 68650 [2019-12-28 01:55:53,454 INFO L226 Difference]: Without dead ends: 68082 [2019-12-28 01:55:53,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:55:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68082 states. [2019-12-28 01:55:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68082 to 53494. [2019-12-28 01:55:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53494 states. [2019-12-28 01:55:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53494 states to 53494 states and 187738 transitions. [2019-12-28 01:55:54,461 INFO L78 Accepts]: Start accepts. Automaton has 53494 states and 187738 transitions. Word has length 57 [2019-12-28 01:55:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:54,461 INFO L462 AbstractCegarLoop]: Abstraction has 53494 states and 187738 transitions. [2019-12-28 01:55:54,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 53494 states and 187738 transitions. [2019-12-28 01:55:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 01:55:54,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:54,472 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] [2019-12-28 01:55:54,473 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1699947683, now seen corresponding path program 1 times [2019-12-28 01:55:54,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:54,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697686703] [2019-12-28 01:55:54,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:54,573 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 01:55:54,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697686703] [2019-12-28 01:55:54,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:54,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:54,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987513650] [2019-12-28 01:55:54,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:54,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:54,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-28 01:55:54,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:54,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:54,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:54,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:54,588 INFO L87 Difference]: Start difference. First operand 53494 states and 187738 transitions. Second operand 6 states. [2019-12-28 01:55:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:55,803 INFO L93 Difference]: Finished difference Result 67853 states and 231364 transitions. [2019-12-28 01:55:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:55,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-28 01:55:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:55,958 INFO L225 Difference]: With dead ends: 67853 [2019-12-28 01:55:55,959 INFO L226 Difference]: Without dead ends: 67853 [2019-12-28 01:55:55,959 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 01:55:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67853 states. [2019-12-28 01:55:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67853 to 59085. [2019-12-28 01:55:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59085 states. [2019-12-28 01:55:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59085 states to 59085 states and 204134 transitions. [2019-12-28 01:55:57,077 INFO L78 Accepts]: Start accepts. Automaton has 59085 states and 204134 transitions. Word has length 58 [2019-12-28 01:55:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:57,077 INFO L462 AbstractCegarLoop]: Abstraction has 59085 states and 204134 transitions. [2019-12-28 01:55:57,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 59085 states and 204134 transitions. [2019-12-28 01:55:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 01:55:57,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:57,088 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] [2019-12-28 01:55:57,088 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:57,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:57,088 INFO L82 PathProgramCache]: Analyzing trace with hash -812444002, now seen corresponding path program 1 times [2019-12-28 01:55:57,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:57,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519592513] [2019-12-28 01:55:57,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:57,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519592513] [2019-12-28 01:55:57,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:57,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:57,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829476230] [2019-12-28 01:55:57,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:57,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:57,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-28 01:55:57,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:57,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:57,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:57,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:57,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:57,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:57,493 INFO L87 Difference]: Start difference. First operand 59085 states and 204134 transitions. Second operand 4 states. [2019-12-28 01:55:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:57,547 INFO L93 Difference]: Finished difference Result 10216 states and 31250 transitions. [2019-12-28 01:55:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:57,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-28 01:55:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:57,560 INFO L225 Difference]: With dead ends: 10216 [2019-12-28 01:55:57,560 INFO L226 Difference]: Without dead ends: 8511 [2019-12-28 01:55:57,560 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 01:55:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-12-28 01:55:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8463. [2019-12-28 01:55:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-12-28 01:55:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 25329 transitions. [2019-12-28 01:55:57,666 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 25329 transitions. Word has length 58 [2019-12-28 01:55:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:57,666 INFO L462 AbstractCegarLoop]: Abstraction has 8463 states and 25329 transitions. [2019-12-28 01:55:57,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 25329 transitions. [2019-12-28 01:55:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:55:57,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:57,669 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 01:55:57,669 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1292079072, now seen corresponding path program 1 times [2019-12-28 01:55:57,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:57,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991961405] [2019-12-28 01:55:57,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:57,736 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 01:55:57,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991961405] [2019-12-28 01:55:57,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:57,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:57,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568721231] [2019-12-28 01:55:57,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:57,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:57,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 65 transitions. [2019-12-28 01:55:57,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:57,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:57,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:57,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:57,760 INFO L87 Difference]: Start difference. First operand 8463 states and 25329 transitions. Second operand 4 states. [2019-12-28 01:55:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:57,893 INFO L93 Difference]: Finished difference Result 9710 states and 29108 transitions. [2019-12-28 01:55:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:57,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 01:55:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:57,912 INFO L225 Difference]: With dead ends: 9710 [2019-12-28 01:55:57,912 INFO L226 Difference]: Without dead ends: 9710 [2019-12-28 01:55:57,913 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 01:55:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2019-12-28 01:55:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 8883. [2019-12-28 01:55:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-12-28 01:55:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 26592 transitions. [2019-12-28 01:55:58,073 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 26592 transitions. Word has length 65 [2019-12-28 01:55:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:58,074 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 26592 transitions. [2019-12-28 01:55:58,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 26592 transitions. [2019-12-28 01:55:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 01:55:58,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:58,077 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 01:55:58,077 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 450731263, now seen corresponding path program 1 times [2019-12-28 01:55:58,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:58,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571289107] [2019-12-28 01:55:58,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:58,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571289107] [2019-12-28 01:55:58,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:58,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:58,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833348438] [2019-12-28 01:55:58,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:58,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:58,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 65 transitions. [2019-12-28 01:55:58,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:58,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:58,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:58,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:58,163 INFO L87 Difference]: Start difference. First operand 8883 states and 26592 transitions. Second operand 6 states. [2019-12-28 01:55:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:58,554 INFO L93 Difference]: Finished difference Result 11199 states and 33079 transitions. [2019-12-28 01:55:58,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:55:58,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-28 01:55:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:58,569 INFO L225 Difference]: With dead ends: 11199 [2019-12-28 01:55:58,569 INFO L226 Difference]: Without dead ends: 11138 [2019-12-28 01:55:58,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-28 01:55:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10414. [2019-12-28 01:55:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-28 01:55:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 30946 transitions. [2019-12-28 01:55:58,692 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 30946 transitions. Word has length 65 [2019-12-28 01:55:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:58,692 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 30946 transitions. [2019-12-28 01:55:58,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 30946 transitions. [2019-12-28 01:55:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:58,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:58,697 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] [2019-12-28 01:55:58,698 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1715256149, now seen corresponding path program 1 times [2019-12-28 01:55:58,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:58,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366330642] [2019-12-28 01:55:58,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:58,761 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 01:55:58,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366330642] [2019-12-28 01:55:58,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:58,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:58,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175649787] [2019-12-28 01:55:58,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:58,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:58,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:58,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:58,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 01:55:58,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:58,863 INFO L87 Difference]: Start difference. First operand 10414 states and 30946 transitions. Second operand 7 states. [2019-12-28 01:55:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:59,233 INFO L93 Difference]: Finished difference Result 13387 states and 39337 transitions. [2019-12-28 01:55:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:59,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 01:55:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:59,253 INFO L225 Difference]: With dead ends: 13387 [2019-12-28 01:55:59,253 INFO L226 Difference]: Without dead ends: 13387 [2019-12-28 01:55:59,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2019-12-28 01:55:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 11728. [2019-12-28 01:55:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-12-28 01:55:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 34581 transitions. [2019-12-28 01:55:59,409 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 34581 transitions. Word has length 71 [2019-12-28 01:55:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:59,409 INFO L462 AbstractCegarLoop]: Abstraction has 11728 states and 34581 transitions. [2019-12-28 01:55:59,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 34581 transitions. [2019-12-28 01:55:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:59,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:59,416 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] [2019-12-28 01:55:59,417 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:59,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash -470491668, now seen corresponding path program 1 times [2019-12-28 01:55:59,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:59,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990356499] [2019-12-28 01:55:59,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:59,553 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 01:55:59,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990356499] [2019-12-28 01:55:59,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:59,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:59,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609047807] [2019-12-28 01:55:59,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:59,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:59,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:55:59,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:59,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-28 01:55:59,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:55:59,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:55:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:55:59,784 INFO L87 Difference]: Start difference. First operand 11728 states and 34581 transitions. Second operand 10 states. [2019-12-28 01:56:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:00,636 INFO L93 Difference]: Finished difference Result 12877 states and 37338 transitions. [2019-12-28 01:56:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:00,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-12-28 01:56:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:00,653 INFO L225 Difference]: With dead ends: 12877 [2019-12-28 01:56:00,654 INFO L226 Difference]: Without dead ends: 12877 [2019-12-28 01:56:00,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:56:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-28 01:56:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 12577. [2019-12-28 01:56:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-12-28 01:56:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 36580 transitions. [2019-12-28 01:56:00,910 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 36580 transitions. Word has length 71 [2019-12-28 01:56:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:00,910 INFO L462 AbstractCegarLoop]: Abstraction has 12577 states and 36580 transitions. [2019-12-28 01:56:00,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 36580 transitions. [2019-12-28 01:56:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:56:00,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:00,918 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] [2019-12-28 01:56:00,918 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1747266285, now seen corresponding path program 1 times [2019-12-28 01:56:00,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:00,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37863837] [2019-12-28 01:56:00,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:01,003 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 01:56:01,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37863837] [2019-12-28 01:56:01,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:01,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:01,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1298257755] [2019-12-28 01:56:01,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:01,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:01,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:56:01,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:01,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 01:56:01,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:01,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:01,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:01,189 INFO L87 Difference]: Start difference. First operand 12577 states and 36580 transitions. Second operand 10 states. [2019-12-28 01:56:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:01,870 INFO L93 Difference]: Finished difference Result 14466 states and 40828 transitions. [2019-12-28 01:56:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:56:01,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-12-28 01:56:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:01,889 INFO L225 Difference]: With dead ends: 14466 [2019-12-28 01:56:01,890 INFO L226 Difference]: Without dead ends: 14466 [2019-12-28 01:56:01,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:56:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-28 01:56:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 13140. [2019-12-28 01:56:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13140 states. [2019-12-28 01:56:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 37549 transitions. [2019-12-28 01:56:02,060 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 37549 transitions. Word has length 71 [2019-12-28 01:56:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:02,060 INFO L462 AbstractCegarLoop]: Abstraction has 13140 states and 37549 transitions. [2019-12-28 01:56:02,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 37549 transitions. [2019-12-28 01:56:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:56:02,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:02,068 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] [2019-12-28 01:56:02,069 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1958617198, now seen corresponding path program 1 times [2019-12-28 01:56:02,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:02,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384840159] [2019-12-28 01:56:02,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:02,137 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 01:56:02,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384840159] [2019-12-28 01:56:02,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:02,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:02,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148468371] [2019-12-28 01:56:02,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:02,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:02,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:56:02,175 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:02,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:56:02,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:02,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:02,211 INFO L87 Difference]: Start difference. First operand 13140 states and 37549 transitions. Second operand 7 states. [2019-12-28 01:56:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:02,709 INFO L93 Difference]: Finished difference Result 16966 states and 48261 transitions. [2019-12-28 01:56:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:56:02,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 01:56:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:02,733 INFO L225 Difference]: With dead ends: 16966 [2019-12-28 01:56:02,733 INFO L226 Difference]: Without dead ends: 16966 [2019-12-28 01:56:02,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:56:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16966 states. [2019-12-28 01:56:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16966 to 15670. [2019-12-28 01:56:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15670 states. [2019-12-28 01:56:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 44446 transitions. [2019-12-28 01:56:02,941 INFO L78 Accepts]: Start accepts. Automaton has 15670 states and 44446 transitions. Word has length 71 [2019-12-28 01:56:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:02,941 INFO L462 AbstractCegarLoop]: Abstraction has 15670 states and 44446 transitions. [2019-12-28 01:56:02,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15670 states and 44446 transitions. [2019-12-28 01:56:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:56:02,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:02,950 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] [2019-12-28 01:56:02,950 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:02,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1448083021, now seen corresponding path program 1 times [2019-12-28 01:56:02,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:02,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442017569] [2019-12-28 01:56:02,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:03,049 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 01:56:03,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442017569] [2019-12-28 01:56:03,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:03,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:03,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847806285] [2019-12-28 01:56:03,050 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:03,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:03,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:56:03,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:03,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:03,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:56:03,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:56:03,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:56:03,094 INFO L87 Difference]: Start difference. First operand 15670 states and 44446 transitions. Second operand 6 states. [2019-12-28 01:56:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:03,256 INFO L93 Difference]: Finished difference Result 16084 states and 44227 transitions. [2019-12-28 01:56:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:56:03,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:56:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:03,276 INFO L225 Difference]: With dead ends: 16084 [2019-12-28 01:56:03,277 INFO L226 Difference]: Without dead ends: 16084 [2019-12-28 01:56:03,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2019-12-28 01:56:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 14714. [2019-12-28 01:56:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14714 states. [2019-12-28 01:56:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 40522 transitions. [2019-12-28 01:56:03,454 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 40522 transitions. Word has length 71 [2019-12-28 01:56:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:03,454 INFO L462 AbstractCegarLoop]: Abstraction has 14714 states and 40522 transitions. [2019-12-28 01:56:03,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:56:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 40522 transitions. [2019-12-28 01:56:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:56:03,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:03,461 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] [2019-12-28 01:56:03,461 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:03,462 INFO L82 PathProgramCache]: Analyzing trace with hash 538635343, now seen corresponding path program 1 times [2019-12-28 01:56:03,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:03,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042791075] [2019-12-28 01:56:03,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:03,533 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 01:56:03,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042791075] [2019-12-28 01:56:03,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:03,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:03,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021976635] [2019-12-28 01:56:03,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:03,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:03,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 175 transitions. [2019-12-28 01:56:03,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:03,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:56:03,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:56:03,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:56:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:56:03,594 INFO L87 Difference]: Start difference. First operand 14714 states and 40522 transitions. Second operand 6 states. [2019-12-28 01:56:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:03,752 INFO L93 Difference]: Finished difference Result 5315 states and 12566 transitions. [2019-12-28 01:56:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:56:03,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:56:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:03,759 INFO L225 Difference]: With dead ends: 5315 [2019-12-28 01:56:03,759 INFO L226 Difference]: Without dead ends: 4643 [2019-12-28 01:56:03,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-12-28 01:56:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 4541. [2019-12-28 01:56:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-28 01:56:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10384 transitions. [2019-12-28 01:56:03,824 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10384 transitions. Word has length 71 [2019-12-28 01:56:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:03,824 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10384 transitions. [2019-12-28 01:56:03,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:56:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10384 transitions. [2019-12-28 01:56:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:56:03,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:03,830 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] [2019-12-28 01:56:03,830 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:03,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1679970640, now seen corresponding path program 1 times [2019-12-28 01:56:03,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:03,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927044219] [2019-12-28 01:56:03,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:03,877 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 01:56:03,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927044219] [2019-12-28 01:56:03,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:03,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:56:03,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [564059664] [2019-12-28 01:56:03,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:03,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:03,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:56:03,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:03,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:03,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:56:03,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:56:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:56:03,908 INFO L87 Difference]: Start difference. First operand 4541 states and 10384 transitions. Second operand 3 states. [2019-12-28 01:56:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:03,947 INFO L93 Difference]: Finished difference Result 5482 states and 12309 transitions. [2019-12-28 01:56:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:56:03,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-28 01:56:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:03,955 INFO L225 Difference]: With dead ends: 5482 [2019-12-28 01:56:03,955 INFO L226 Difference]: Without dead ends: 5482 [2019-12-28 01:56:03,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:56:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2019-12-28 01:56:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 4476. [2019-12-28 01:56:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-12-28 01:56:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 9946 transitions. [2019-12-28 01:56:04,016 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 9946 transitions. Word has length 71 [2019-12-28 01:56:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:04,017 INFO L462 AbstractCegarLoop]: Abstraction has 4476 states and 9946 transitions. [2019-12-28 01:56:04,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:56:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 9946 transitions. [2019-12-28 01:56:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 01:56:04,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:04,023 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] [2019-12-28 01:56:04,023 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1543631293, now seen corresponding path program 1 times [2019-12-28 01:56:04,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:04,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359148392] [2019-12-28 01:56:04,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:04,078 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 01:56:04,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359148392] [2019-12-28 01:56:04,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:04,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:04,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1669326433] [2019-12-28 01:56:04,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:04,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:04,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 77 transitions. [2019-12-28 01:56:04,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:04,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:04,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:04,114 INFO L87 Difference]: Start difference. First operand 4476 states and 9946 transitions. Second operand 5 states. [2019-12-28 01:56:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:04,295 INFO L93 Difference]: Finished difference Result 5533 states and 12363 transitions. [2019-12-28 01:56:04,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:56:04,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-28 01:56:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:04,303 INFO L225 Difference]: With dead ends: 5533 [2019-12-28 01:56:04,303 INFO L226 Difference]: Without dead ends: 5533 [2019-12-28 01:56:04,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:56:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-12-28 01:56:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 4896. [2019-12-28 01:56:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2019-12-28 01:56:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10904 transitions. [2019-12-28 01:56:04,352 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10904 transitions. Word has length 77 [2019-12-28 01:56:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:04,352 INFO L462 AbstractCegarLoop]: Abstraction has 4896 states and 10904 transitions. [2019-12-28 01:56:04,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:56:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10904 transitions. [2019-12-28 01:56:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 01:56:04,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:04,357 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] [2019-12-28 01:56:04,357 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 199179042, now seen corresponding path program 1 times [2019-12-28 01:56:04,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:04,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996259099] [2019-12-28 01:56:04,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:56:04,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996259099] [2019-12-28 01:56:04,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:04,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:04,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52454086] [2019-12-28 01:56:04,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:04,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:04,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 77 transitions. [2019-12-28 01:56:04,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:04,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:04,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:04,465 INFO L87 Difference]: Start difference. First operand 4896 states and 10904 transitions. Second operand 7 states. [2019-12-28 01:56:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:04,886 INFO L93 Difference]: Finished difference Result 5669 states and 12508 transitions. [2019-12-28 01:56:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:56:04,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-28 01:56:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:04,893 INFO L225 Difference]: With dead ends: 5669 [2019-12-28 01:56:04,893 INFO L226 Difference]: Without dead ends: 5616 [2019-12-28 01:56:04,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:56:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2019-12-28 01:56:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4983. [2019-12-28 01:56:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-28 01:56:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 10993 transitions. [2019-12-28 01:56:04,941 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 10993 transitions. Word has length 77 [2019-12-28 01:56:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:04,941 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 10993 transitions. [2019-12-28 01:56:04,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 10993 transitions. [2019-12-28 01:56:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:56:04,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:04,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:04,946 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash -283880815, now seen corresponding path program 1 times [2019-12-28 01:56:04,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:04,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595886153] [2019-12-28 01:56:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:05,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 01:56:05,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595886153] [2019-12-28 01:56:05,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:05,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:05,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [980849297] [2019-12-28 01:56:05,010 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:05,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:05,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 232 transitions. [2019-12-28 01:56:05,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:05,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:56:05,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:05,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:05,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:05,168 INFO L87 Difference]: Start difference. First operand 4983 states and 10993 transitions. Second operand 7 states. [2019-12-28 01:56:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:06,434 INFO L93 Difference]: Finished difference Result 8168 states and 18092 transitions. [2019-12-28 01:56:06,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:56:06,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 01:56:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:06,444 INFO L225 Difference]: With dead ends: 8168 [2019-12-28 01:56:06,445 INFO L226 Difference]: Without dead ends: 8168 [2019-12-28 01:56:06,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-28 01:56:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8168 states. [2019-12-28 01:56:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8168 to 5105. [2019-12-28 01:56:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2019-12-28 01:56:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 11259 transitions. [2019-12-28 01:56:06,511 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 11259 transitions. Word has length 98 [2019-12-28 01:56:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:06,512 INFO L462 AbstractCegarLoop]: Abstraction has 5105 states and 11259 transitions. [2019-12-28 01:56:06,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 11259 transitions. [2019-12-28 01:56:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:56:06,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:06,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:56:06,517 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1087998493, now seen corresponding path program 2 times [2019-12-28 01:56:06,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:06,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899004703] [2019-12-28 01:56:06,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:56:06,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899004703] [2019-12-28 01:56:06,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:06,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:06,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24872794] [2019-12-28 01:56:06,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:06,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:06,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 227 transitions. [2019-12-28 01:56:06,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:06,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:06,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:06,882 INFO L87 Difference]: Start difference. First operand 5105 states and 11259 transitions. Second operand 10 states. [2019-12-28 01:56:09,458 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-28 01:56:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:10,788 INFO L93 Difference]: Finished difference Result 12301 states and 26537 transitions. [2019-12-28 01:56:10,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-28 01:56:10,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-28 01:56:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:10,803 INFO L225 Difference]: With dead ends: 12301 [2019-12-28 01:56:10,804 INFO L226 Difference]: Without dead ends: 12242 [2019-12-28 01:56:10,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=765, Unknown=0, NotChecked=0, Total=992 [2019-12-28 01:56:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12242 states. [2019-12-28 01:56:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12242 to 7682. [2019-12-28 01:56:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7682 states. [2019-12-28 01:56:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 16737 transitions. [2019-12-28 01:56:10,907 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 16737 transitions. Word has length 98 [2019-12-28 01:56:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:10,908 INFO L462 AbstractCegarLoop]: Abstraction has 7682 states and 16737 transitions. [2019-12-28 01:56:10,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 16737 transitions. [2019-12-28 01:56:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:56:10,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:10,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:10,916 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018300, now seen corresponding path program 1 times [2019-12-28 01:56:10,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:10,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155351193] [2019-12-28 01:56:10,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:11,005 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 01:56:11,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155351193] [2019-12-28 01:56:11,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:11,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:11,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040809816] [2019-12-28 01:56:11,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:11,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:11,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 227 transitions. [2019-12-28 01:56:11,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:11,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 01:56:11,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:56:11,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:56:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:56:11,314 INFO L87 Difference]: Start difference. First operand 7682 states and 16737 transitions. Second operand 13 states. [2019-12-28 01:56:18,135 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-12-28 01:56:19,537 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-28 01:56:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:20,769 INFO L93 Difference]: Finished difference Result 28977 states and 62633 transitions. [2019-12-28 01:56:20,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-28 01:56:20,769 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-12-28 01:56:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:20,798 INFO L225 Difference]: With dead ends: 28977 [2019-12-28 01:56:20,798 INFO L226 Difference]: Without dead ends: 28977 [2019-12-28 01:56:20,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3773 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1707, Invalid=8595, Unknown=0, NotChecked=0, Total=10302 [2019-12-28 01:56:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28977 states. [2019-12-28 01:56:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28977 to 8484. [2019-12-28 01:56:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-28 01:56:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 18511 transitions. [2019-12-28 01:56:20,993 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 18511 transitions. Word has length 98 [2019-12-28 01:56:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:20,994 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 18511 transitions. [2019-12-28 01:56:20,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:56:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 18511 transitions. [2019-12-28 01:56:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 01:56:21,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:21,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:56:21,004 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash -919037989, now seen corresponding path program 1 times [2019-12-28 01:56:21,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:21,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171144410] [2019-12-28 01:56:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:21,066 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 01:56:21,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171144410] [2019-12-28 01:56:21,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:21,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:56:21,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145713374] [2019-12-28 01:56:21,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:21,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:21,182 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 227 transitions. [2019-12-28 01:56:21,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:21,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:56:21,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:21,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:21,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:21,304 INFO L87 Difference]: Start difference. First operand 8484 states and 18511 transitions. Second operand 10 states. [2019-12-28 01:56:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:22,176 INFO L93 Difference]: Finished difference Result 11931 states and 25612 transitions. [2019-12-28 01:56:22,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:56:22,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-28 01:56:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:22,190 INFO L225 Difference]: With dead ends: 11931 [2019-12-28 01:56:22,190 INFO L226 Difference]: Without dead ends: 11642 [2019-12-28 01:56:22,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:56:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2019-12-28 01:56:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 7657. [2019-12-28 01:56:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7657 states. [2019-12-28 01:56:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7657 states to 7657 states and 16728 transitions. [2019-12-28 01:56:22,295 INFO L78 Accepts]: Start accepts. Automaton has 7657 states and 16728 transitions. Word has length 98 [2019-12-28 01:56:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:22,296 INFO L462 AbstractCegarLoop]: Abstraction has 7657 states and 16728 transitions. [2019-12-28 01:56:22,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7657 states and 16728 transitions. [2019-12-28 01:56:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:22,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:22,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:22,303 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 663708553, now seen corresponding path program 1 times [2019-12-28 01:56:22,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:22,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643272320] [2019-12-28 01:56:22,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:22,412 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 01:56:22,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643272320] [2019-12-28 01:56:22,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:22,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:22,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [387502773] [2019-12-28 01:56:22,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:22,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:22,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 246 transitions. [2019-12-28 01:56:22,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:22,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:56:22,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:22,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:22,656 INFO L87 Difference]: Start difference. First operand 7657 states and 16728 transitions. Second operand 7 states. [2019-12-28 01:56:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:22,979 INFO L93 Difference]: Finished difference Result 8327 states and 18108 transitions. [2019-12-28 01:56:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:56:22,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:22,989 INFO L225 Difference]: With dead ends: 8327 [2019-12-28 01:56:22,989 INFO L226 Difference]: Without dead ends: 8327 [2019-12-28 01:56:22,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-12-28 01:56:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7529. [2019-12-28 01:56:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2019-12-28 01:56:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 16497 transitions. [2019-12-28 01:56:23,060 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 16497 transitions. Word has length 100 [2019-12-28 01:56:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:23,060 INFO L462 AbstractCegarLoop]: Abstraction has 7529 states and 16497 transitions. [2019-12-28 01:56:23,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 16497 transitions. [2019-12-28 01:56:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:23,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:23,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:23,067 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash -582643184, now seen corresponding path program 1 times [2019-12-28 01:56:23,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:23,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429475676] [2019-12-28 01:56:23,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:23,132 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 01:56:23,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429475676] [2019-12-28 01:56:23,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:23,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:23,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562634409] [2019-12-28 01:56:23,133 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:23,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:23,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:23,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:23,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:23,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:56:23,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:56:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:56:23,246 INFO L87 Difference]: Start difference. First operand 7529 states and 16497 transitions. Second operand 6 states. [2019-12-28 01:56:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:23,411 INFO L93 Difference]: Finished difference Result 8590 states and 18760 transitions. [2019-12-28 01:56:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:23,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-28 01:56:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:23,426 INFO L225 Difference]: With dead ends: 8590 [2019-12-28 01:56:23,427 INFO L226 Difference]: Without dead ends: 8590 [2019-12-28 01:56:23,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2019-12-28 01:56:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 6460. [2019-12-28 01:56:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-28 01:56:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 14157 transitions. [2019-12-28 01:56:23,574 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 14157 transitions. Word has length 100 [2019-12-28 01:56:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:23,575 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 14157 transitions. [2019-12-28 01:56:23,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:56:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 14157 transitions. [2019-12-28 01:56:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:23,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:23,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:23,587 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:23,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash -231843247, now seen corresponding path program 1 times [2019-12-28 01:56:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:23,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601324847] [2019-12-28 01:56:23,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:23,663 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 01:56:23,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601324847] [2019-12-28 01:56:23,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:23,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:56:23,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930188593] [2019-12-28 01:56:23,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:23,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:23,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:23,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:23,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:23,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:56:23,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:56:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:56:23,792 INFO L87 Difference]: Start difference. First operand 6460 states and 14157 transitions. Second operand 4 states. [2019-12-28 01:56:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:24,030 INFO L93 Difference]: Finished difference Result 7605 states and 16603 transitions. [2019-12-28 01:56:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:56:24,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-28 01:56:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:24,041 INFO L225 Difference]: With dead ends: 7605 [2019-12-28 01:56:24,041 INFO L226 Difference]: Without dead ends: 7559 [2019-12-28 01:56:24,041 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 01:56:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2019-12-28 01:56:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 6490. [2019-12-28 01:56:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-12-28 01:56:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 14336 transitions. [2019-12-28 01:56:24,125 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 14336 transitions. Word has length 100 [2019-12-28 01:56:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:24,125 INFO L462 AbstractCegarLoop]: Abstraction has 6490 states and 14336 transitions. [2019-12-28 01:56:24,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:56:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 14336 transitions. [2019-12-28 01:56:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:24,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:24,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:24,131 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -200823440, now seen corresponding path program 1 times [2019-12-28 01:56:24,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:24,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146289912] [2019-12-28 01:56:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:24,283 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 01:56:24,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146289912] [2019-12-28 01:56:24,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:24,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:56:24,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1011122579] [2019-12-28 01:56:24,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:24,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:24,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:24,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:24,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:56:24,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:56:24,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:56:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:56:24,528 INFO L87 Difference]: Start difference. First operand 6490 states and 14336 transitions. Second operand 13 states. [2019-12-28 01:56:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:27,659 INFO L93 Difference]: Finished difference Result 9501 states and 20759 transitions. [2019-12-28 01:56:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-28 01:56:27,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2019-12-28 01:56:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:27,671 INFO L225 Difference]: With dead ends: 9501 [2019-12-28 01:56:27,671 INFO L226 Difference]: Without dead ends: 9501 [2019-12-28 01:56:27,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=371, Invalid=1521, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 01:56:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9501 states. [2019-12-28 01:56:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9501 to 6809. [2019-12-28 01:56:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6809 states. [2019-12-28 01:56:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 14999 transitions. [2019-12-28 01:56:27,747 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 14999 transitions. Word has length 100 [2019-12-28 01:56:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:27,747 INFO L462 AbstractCegarLoop]: Abstraction has 6809 states and 14999 transitions. [2019-12-28 01:56:27,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:56:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 14999 transitions. [2019-12-28 01:56:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:27,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:27,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:27,753 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2056087567, now seen corresponding path program 1 times [2019-12-28 01:56:27,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:27,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841055861] [2019-12-28 01:56:27,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:27,899 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 01:56:27,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841055861] [2019-12-28 01:56:27,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:27,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:56:27,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [961266789] [2019-12-28 01:56:27,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:27,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:27,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 188 transitions. [2019-12-28 01:56:27,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:27,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-28 01:56:28,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 01:56:28,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:56:28,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:56:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:56:28,037 INFO L87 Difference]: Start difference. First operand 6809 states and 14999 transitions. Second operand 11 states. [2019-12-28 01:56:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:28,291 INFO L93 Difference]: Finished difference Result 11673 states and 25842 transitions. [2019-12-28 01:56:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:56:28,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-12-28 01:56:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:28,297 INFO L225 Difference]: With dead ends: 11673 [2019-12-28 01:56:28,298 INFO L226 Difference]: Without dead ends: 5059 [2019-12-28 01:56:28,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:56:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2019-12-28 01:56:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4565. [2019-12-28 01:56:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-12-28 01:56:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 10113 transitions. [2019-12-28 01:56:28,344 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 10113 transitions. Word has length 100 [2019-12-28 01:56:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:28,344 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 10113 transitions. [2019-12-28 01:56:28,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:56:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 10113 transitions. [2019-12-28 01:56:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:28,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:28,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:28,348 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash -752397989, now seen corresponding path program 2 times [2019-12-28 01:56:28,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:28,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517281883] [2019-12-28 01:56:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:28,513 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 01:56:28,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517281883] [2019-12-28 01:56:28,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:28,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:56:28,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357838509] [2019-12-28 01:56:28,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:28,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:28,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 170 transitions. [2019-12-28 01:56:28,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:28,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:56:28,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:56:28,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:56:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:56:28,613 INFO L87 Difference]: Start difference. First operand 4565 states and 10113 transitions. Second operand 11 states. [2019-12-28 01:56:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:29,124 INFO L93 Difference]: Finished difference Result 10179 states and 22783 transitions. [2019-12-28 01:56:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 01:56:29,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-12-28 01:56:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:29,132 INFO L225 Difference]: With dead ends: 10179 [2019-12-28 01:56:29,132 INFO L226 Difference]: Without dead ends: 6485 [2019-12-28 01:56:29,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-28 01:56:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6485 states. [2019-12-28 01:56:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6485 to 4590. [2019-12-28 01:56:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4590 states. [2019-12-28 01:56:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 10119 transitions. [2019-12-28 01:56:29,183 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 10119 transitions. Word has length 100 [2019-12-28 01:56:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:29,183 INFO L462 AbstractCegarLoop]: Abstraction has 4590 states and 10119 transitions. [2019-12-28 01:56:29,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:56:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 10119 transitions. [2019-12-28 01:56:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:29,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:29,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:56:29,187 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1039722168, now seen corresponding path program 1 times [2019-12-28 01:56:29,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:29,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344672114] [2019-12-28 01:56:29,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:29,291 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 01:56:29,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344672114] [2019-12-28 01:56:29,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:29,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:29,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325337994] [2019-12-28 01:56:29,292 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:29,310 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:29,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 187 transitions. [2019-12-28 01:56:29,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:29,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:56:29,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:29,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:29,411 INFO L87 Difference]: Start difference. First operand 4590 states and 10119 transitions. Second operand 7 states. [2019-12-28 01:56:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:29,587 INFO L93 Difference]: Finished difference Result 5050 states and 11054 transitions. [2019-12-28 01:56:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:56:29,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:29,593 INFO L225 Difference]: With dead ends: 5050 [2019-12-28 01:56:29,593 INFO L226 Difference]: Without dead ends: 5022 [2019-12-28 01:56:29,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2019-12-28 01:56:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4523. [2019-12-28 01:56:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4523 states. [2019-12-28 01:56:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 9912 transitions. [2019-12-28 01:56:29,637 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 9912 transitions. Word has length 100 [2019-12-28 01:56:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:29,638 INFO L462 AbstractCegarLoop]: Abstraction has 4523 states and 9912 transitions. [2019-12-28 01:56:29,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 9912 transitions. [2019-12-28 01:56:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:29,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:29,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:56:29,642 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -629122451, now seen corresponding path program 1 times [2019-12-28 01:56:29,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:29,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356084776] [2019-12-28 01:56:29,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:29,701 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 01:56:29,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356084776] [2019-12-28 01:56:29,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:29,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:56:29,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210748099] [2019-12-28 01:56:29,702 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:29,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:29,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-28 01:56:29,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:29,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:29,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:56:29,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:56:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:56:29,814 INFO L87 Difference]: Start difference. First operand 4523 states and 9912 transitions. Second operand 5 states. [2019-12-28 01:56:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:30,106 INFO L93 Difference]: Finished difference Result 5434 states and 11776 transitions. [2019-12-28 01:56:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:30,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-28 01:56:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:30,113 INFO L225 Difference]: With dead ends: 5434 [2019-12-28 01:56:30,113 INFO L226 Difference]: Without dead ends: 5356 [2019-12-28 01:56:30,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 01:56:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2019-12-28 01:56:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 4548. [2019-12-28 01:56:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-12-28 01:56:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 9976 transitions. [2019-12-28 01:56:30,256 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 9976 transitions. Word has length 100 [2019-12-28 01:56:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:30,256 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 9976 transitions. [2019-12-28 01:56:30,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:56:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 9976 transitions. [2019-12-28 01:56:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:30,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:30,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:30,263 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2013230097, now seen corresponding path program 2 times [2019-12-28 01:56:30,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:30,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459718704] [2019-12-28 01:56:30,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:30,415 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 01:56:30,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459718704] [2019-12-28 01:56:30,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:30,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:56:30,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1437035232] [2019-12-28 01:56:30,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:30,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:30,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-28 01:56:30,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:30,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:30,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:56:30,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:56:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:56:30,549 INFO L87 Difference]: Start difference. First operand 4548 states and 9976 transitions. Second operand 11 states. [2019-12-28 01:56:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:32,116 INFO L93 Difference]: Finished difference Result 5446 states and 11886 transitions. [2019-12-28 01:56:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 01:56:32,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-12-28 01:56:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:32,124 INFO L225 Difference]: With dead ends: 5446 [2019-12-28 01:56:32,124 INFO L226 Difference]: Without dead ends: 5426 [2019-12-28 01:56:32,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:56:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-12-28 01:56:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4594. [2019-12-28 01:56:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2019-12-28 01:56:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 10090 transitions. [2019-12-28 01:56:32,169 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 10090 transitions. Word has length 100 [2019-12-28 01:56:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:32,169 INFO L462 AbstractCegarLoop]: Abstraction has 4594 states and 10090 transitions. [2019-12-28 01:56:32,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:56:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 10090 transitions. [2019-12-28 01:56:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:32,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:32,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:32,174 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash 243680910, now seen corresponding path program 1 times [2019-12-28 01:56:32,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:32,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551113945] [2019-12-28 01:56:32,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:56:32,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551113945] [2019-12-28 01:56:32,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:32,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:32,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258179301] [2019-12-28 01:56:32,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:32,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:32,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 185 transitions. [2019-12-28 01:56:32,375 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:32,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:56:32,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:56:32,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:32,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:56:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:56:32,393 INFO L87 Difference]: Start difference. First operand 4594 states and 10090 transitions. Second operand 7 states. [2019-12-28 01:56:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:32,580 INFO L93 Difference]: Finished difference Result 4725 states and 10329 transitions. [2019-12-28 01:56:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:32,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-28 01:56:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:32,587 INFO L225 Difference]: With dead ends: 4725 [2019-12-28 01:56:32,588 INFO L226 Difference]: Without dead ends: 4725 [2019-12-28 01:56:32,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:56:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-28 01:56:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4473. [2019-12-28 01:56:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4473 states. [2019-12-28 01:56:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 9809 transitions. [2019-12-28 01:56:32,630 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 9809 transitions. Word has length 100 [2019-12-28 01:56:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:32,630 INFO L462 AbstractCegarLoop]: Abstraction has 4473 states and 9809 transitions. [2019-12-28 01:56:32,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:56:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 9809 transitions. [2019-12-28 01:56:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:32,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:32,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:32,634 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 117038585, now seen corresponding path program 1 times [2019-12-28 01:56:32,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:32,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545276847] [2019-12-28 01:56:32,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:56:32,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545276847] [2019-12-28 01:56:32,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:32,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:32,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563257599] [2019-12-28 01:56:32,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:32,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:32,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 187 transitions. [2019-12-28 01:56:32,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:32,957 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:56:32,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:32,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:32,957 INFO L87 Difference]: Start difference. First operand 4473 states and 9809 transitions. Second operand 10 states. [2019-12-28 01:56:33,847 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-28 01:56:34,217 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-12-28 01:56:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:34,888 INFO L93 Difference]: Finished difference Result 6002 states and 12930 transitions. [2019-12-28 01:56:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:56:34,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-28 01:56:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:34,897 INFO L225 Difference]: With dead ends: 6002 [2019-12-28 01:56:34,897 INFO L226 Difference]: Without dead ends: 6002 [2019-12-28 01:56:34,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-12-28 01:56:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-28 01:56:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 4495. [2019-12-28 01:56:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4495 states. [2019-12-28 01:56:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4495 states to 4495 states and 9857 transitions. [2019-12-28 01:56:34,948 INFO L78 Accepts]: Start accepts. Automaton has 4495 states and 9857 transitions. Word has length 100 [2019-12-28 01:56:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:34,949 INFO L462 AbstractCegarLoop]: Abstraction has 4495 states and 9857 transitions. [2019-12-28 01:56:34,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4495 states and 9857 transitions. [2019-12-28 01:56:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:34,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:34,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:34,953 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1921017704, now seen corresponding path program 1 times [2019-12-28 01:56:34,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:34,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256271649] [2019-12-28 01:56:34,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:35,107 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 01:56:35,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256271649] [2019-12-28 01:56:35,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:35,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:35,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874159622] [2019-12-28 01:56:35,109 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:35,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:35,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 187 transitions. [2019-12-28 01:56:35,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:35,348 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:56:35,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 01:56:35,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 01:56:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-28 01:56:35,349 INFO L87 Difference]: Start difference. First operand 4495 states and 9857 transitions. Second operand 10 states. [2019-12-28 01:56:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:36,828 INFO L93 Difference]: Finished difference Result 5734 states and 12417 transitions. [2019-12-28 01:56:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 01:56:36,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-28 01:56:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:36,837 INFO L225 Difference]: With dead ends: 5734 [2019-12-28 01:56:36,837 INFO L226 Difference]: Without dead ends: 5734 [2019-12-28 01:56:36,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-12-28 01:56:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2019-12-28 01:56:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 4541. [2019-12-28 01:56:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-28 01:56:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 9935 transitions. [2019-12-28 01:56:36,885 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 9935 transitions. Word has length 100 [2019-12-28 01:56:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:36,885 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 9935 transitions. [2019-12-28 01:56:36,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 01:56:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 9935 transitions. [2019-12-28 01:56:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:36,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:36,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:36,890 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash -805563302, now seen corresponding path program 2 times [2019-12-28 01:56:36,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:36,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599078823] [2019-12-28 01:56:36,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:37,017 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 01:56:37,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599078823] [2019-12-28 01:56:37,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:37,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:56:37,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259266193] [2019-12-28 01:56:37,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:37,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:37,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 203 transitions. [2019-12-28 01:56:37,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:37,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:56:37,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 01:56:37,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:37,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 01:56:37,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:56:37,198 INFO L87 Difference]: Start difference. First operand 4541 states and 9935 transitions. Second operand 12 states. [2019-12-28 01:56:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:39,390 INFO L93 Difference]: Finished difference Result 5856 states and 12657 transitions. [2019-12-28 01:56:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-28 01:56:39,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-12-28 01:56:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:39,397 INFO L225 Difference]: With dead ends: 5856 [2019-12-28 01:56:39,397 INFO L226 Difference]: Without dead ends: 5856 [2019-12-28 01:56:39,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 01:56:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states. [2019-12-28 01:56:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 4552. [2019-12-28 01:56:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-12-28 01:56:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 9967 transitions. [2019-12-28 01:56:39,443 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 9967 transitions. Word has length 100 [2019-12-28 01:56:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:39,444 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 9967 transitions. [2019-12-28 01:56:39,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 01:56:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 9967 transitions. [2019-12-28 01:56:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-28 01:56:39,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:39,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:56:39,449 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1451347705, now seen corresponding path program 3 times [2019-12-28 01:56:39,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:39,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757597233] [2019-12-28 01:56:39,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:56:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:56:39,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:56:39,537 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:56:39,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:56:39 BasicIcfg [2019-12-28 01:56:39,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:56:39,725 INFO L168 Benchmark]: Toolchain (without parser) took 82471.79 ms. Allocated memory was 145.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 102.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,726 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.17 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 155.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.07 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,727 INFO L168 Benchmark]: Boogie Preprocessor took 47.48 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,727 INFO L168 Benchmark]: RCFGBuilder took 748.19 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 106.0 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,727 INFO L168 Benchmark]: TraceAbstraction took 80823.40 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 105.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-28 01:56:39,729 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.17 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 155.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.07 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.48 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.19 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 106.0 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80823.40 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 105.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t845; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L815] 0 pthread_t t846; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 80.4s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 47.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11439 SDtfs, 18306 SDslu, 33602 SDs, 0 SdLazy, 20248 SolverSat, 1078 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 240 SyntacticMatches, 36 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5283 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71016occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 119241 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3109 NumberOfCodeBlocks, 3109 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2971 ConstructedInterpolants, 0 QuantifiedInterpolants, 704093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...