/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:34:50,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:34:50,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:34:50,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:34:50,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:34:50,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:34:50,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:34:50,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:34:50,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:34:50,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:34:50,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:34:50,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:34:50,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:34:50,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:34:50,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:34:50,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:34:50,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:34:50,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:34:50,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:34:50,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:34:50,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:34:50,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:34:50,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:34:50,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:34:50,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:34:50,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:34:50,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:34:50,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:34:50,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:34:50,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:34:50,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:34:50,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:34:50,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:34:50,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:34:50,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:34:50,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:34:50,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:34:50,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:34:50,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:34:50,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:34:50,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:34:50,924 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-VariableLbe-MCR.epf [2019-12-27 21:34:50,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:34:50,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:34:50,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:34:50,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:34:50,948 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:34:50,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:34:50,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:34:50,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:34:50,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:34:50,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:34:50,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:34:50,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:34:50,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:34:50,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:34:50,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:34:50,951 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:34:50,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:34:50,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:34:50,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:34:50,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:34:50,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:34:50,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:34:50,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:34:50,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:34:50,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:34:50,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:34:50,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:34:50,954 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:34:50,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:34:50,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:34:50,955 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:34:50,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:34:51,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:34:51,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:34:51,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:34:51,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:34:51,266 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:34:51,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 21:34:51,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1206b1b6f/24647fd25c004933aa284938926bcdfe/FLAGd4fe9abbd [2019-12-27 21:34:51,934 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:34:51,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 21:34:51,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1206b1b6f/24647fd25c004933aa284938926bcdfe/FLAGd4fe9abbd [2019-12-27 21:34:52,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1206b1b6f/24647fd25c004933aa284938926bcdfe [2019-12-27 21:34:52,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:34:52,210 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:34:52,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:34:52,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:34:52,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:34:52,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:34:52" (1/1) ... [2019-12-27 21:34:52,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:52, skipping insertion in model container [2019-12-27 21:34:52,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:34:52" (1/1) ... [2019-12-27 21:34:52,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:34:52,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:34:52,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:34:52,917 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:34:53,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:34:53,090 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:34:53,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53 WrapperNode [2019-12-27 21:34:53,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:34:53,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:34:53,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:34:53,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:34:53,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:34:53,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:34:53,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:34:53,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:34:53,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (1/1) ... [2019-12-27 21:34:53,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:34:53,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:34:53,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:34:53,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:34:53,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (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-27 21:34:53,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:34:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:34:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:34:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:34:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:34:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:34:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:34:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:34:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:34:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:34:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:34:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:34:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:34:53,273 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:34:54,080 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:34:54,080 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:34:54,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:34:54 BoogieIcfgContainer [2019-12-27 21:34:54,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:34:54,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:34:54,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:34:54,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:34:54,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:34:52" (1/3) ... [2019-12-27 21:34:54,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fbb40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:34:54, skipping insertion in model container [2019-12-27 21:34:54,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:53" (2/3) ... [2019-12-27 21:34:54,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fbb40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:34:54, skipping insertion in model container [2019-12-27 21:34:54,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:34:54" (3/3) ... [2019-12-27 21:34:54,093 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.opt.i [2019-12-27 21:34:54,103 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:34:54,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:34:54,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:34:54,113 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:34:54,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,172 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,224 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,228 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,230 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:54,263 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:34:54,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:34:54,284 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:34:54,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:34:54,284 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:34:54,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:34:54,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:34:54,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:34:54,285 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:34:54,309 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 21:34:54,311 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:34:54,433 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:34:54,434 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:34:54,453 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:34:54,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:34:54,568 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:34:54,568 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:34:54,577 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:34:54,598 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:34:54,600 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:34:58,306 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 21:34:58,439 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 21:34:58,481 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 21:34:58,482 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 21:34:58,485 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 21:35:14,120 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 21:35:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 21:35:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:35:14,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:14,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:35:14,128 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:14,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 21:35:14,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:14,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34064012] [2019-12-27 21:35:14,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:14,396 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-27 21:35:14,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34064012] [2019-12-27 21:35:14,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:14,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:35:14,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738751593] [2019-12-27 21:35:14,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:14,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:14,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:35:14,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:14,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:14,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:35:14,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:35:14,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:14,441 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 21:35:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:16,077 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 21:35:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:35:16,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:35:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:19,700 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 21:35:19,700 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 21:35:19,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-27 21:35:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 21:35:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 21:35:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 21:35:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 21:35:31,105 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 21:35:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:31,105 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 21:35:31,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:35:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 21:35:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:35:31,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:31,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:31,111 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 21:35:31,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:31,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54376442] [2019-12-27 21:35:31,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:31,269 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-27 21:35:31,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54376442] [2019-12-27 21:35:31,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:31,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:35:31,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834272931] [2019-12-27 21:35:31,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:31,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:31,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:35:31,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:31,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:31,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:35:31,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:35:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:35:31,284 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 21:35:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:33,671 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 21:35:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:35:33,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:35:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:34,342 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 21:35:34,342 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 21:35:34,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 21:35:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 21:35:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 21:35:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 21:35:46,501 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 21:35:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:46,502 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 21:35:46,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:35:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 21:35:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:35:46,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:46,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:46,511 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 21:35:46,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:46,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203599879] [2019-12-27 21:35:46,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:46,608 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-27 21:35:46,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203599879] [2019-12-27 21:35:46,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:46,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:35:46,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188014375] [2019-12-27 21:35:46,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:46,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:46,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:35:46,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:46,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:46,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:35:46,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:35:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:46,618 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 21:35:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:46,777 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 21:35:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:35:46,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:35:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:46,842 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 21:35:46,842 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 21:35:46,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 21:35:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 21:35:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 21:35:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 21:35:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 21:35:51,899 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 21:35:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:51,899 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 21:35:51,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:35:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 21:35:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:35:51,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:51,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:51,902 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:51,903 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 21:35:51,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:51,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157851710] [2019-12-27 21:35:51,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:52,011 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-27 21:35:52,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157851710] [2019-12-27 21:35:52,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:52,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:35:52,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877291573] [2019-12-27 21:35:52,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:52,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:52,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:35:52,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:52,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:52,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:35:52,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:35:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:52,022 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 21:35:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:52,535 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 21:35:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:35:52,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:35:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:52,613 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 21:35:52,613 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 21:35:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:35:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 21:35:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 21:35:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 21:35:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 21:35:53,595 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 21:35:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:53,596 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 21:35:53,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:35:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 21:35:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:35:53,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:53,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:53,606 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:53,606 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 21:35:53,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:53,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108451549] [2019-12-27 21:35:53,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:53,716 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-27 21:35:53,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108451549] [2019-12-27 21:35:53,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:53,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:35:53,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403862176] [2019-12-27 21:35:53,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:53,721 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:53,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 21:35:53,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:53,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:53,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:35:53,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:35:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:35:53,732 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 21:35:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:54,876 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 21:35:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:35:54,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 21:35:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:54,971 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 21:35:54,971 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 21:35:54,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:35:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 21:35:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 21:35:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 21:35:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 21:35:56,102 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 21:35:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:56,103 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 21:35:56,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:35:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 21:35:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:35:56,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:56,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:56,118 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:56,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 21:35:56,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:56,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871003861] [2019-12-27 21:35:56,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:56,181 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-27 21:35:56,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871003861] [2019-12-27 21:35:56,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:56,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:35:56,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378921602] [2019-12-27 21:35:56,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:56,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:56,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:35:56,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:56,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:35:56,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:35:56,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:35:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:56,241 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 5 states. [2019-12-27 21:35:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:56,321 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 21:35:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:35:56,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:35:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:56,342 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 21:35:56,343 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 21:35:56,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 21:35:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 21:35:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 21:35:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 21:35:56,568 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 21:35:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:56,568 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 21:35:56,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:35:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 21:35:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:35:56,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:56,579 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] [2019-12-27 21:35:56,579 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 21:35:56,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:56,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839367001] [2019-12-27 21:35:56,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:56,699 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-27 21:35:56,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839367001] [2019-12-27 21:35:56,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:56,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:35:56,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741528957] [2019-12-27 21:35:56,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:56,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:56,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:35:56,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:56,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:56,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:35:56,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:35:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:35:56,712 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 21:35:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:57,362 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 21:35:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:35:57,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:35:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:57,393 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 21:35:57,393 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 21:35:57,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:35:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 21:35:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 21:35:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 21:35:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 21:35:57,678 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 21:35:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:57,679 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 21:35:57,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:35:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 21:35:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:35:57,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:57,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] [2019-12-27 21:35:57,698 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 21:35:57,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:57,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234799105] [2019-12-27 21:35:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:57,894 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-27 21:35:57,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234799105] [2019-12-27 21:35:57,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:57,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:35:57,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219415164] [2019-12-27 21:35:57,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:57,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:58,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:35:58,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:58,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:58,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:35:58,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:58,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:35:58,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:35:58,108 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 9 states. [2019-12-27 21:35:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:59,439 INFO L93 Difference]: Finished difference Result 24849 states and 72852 transitions. [2019-12-27 21:35:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:35:59,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 21:35:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:59,475 INFO L225 Difference]: With dead ends: 24849 [2019-12-27 21:35:59,476 INFO L226 Difference]: Without dead ends: 24849 [2019-12-27 21:35:59,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:35:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24849 states. [2019-12-27 21:35:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24849 to 17725. [2019-12-27 21:35:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-27 21:35:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 53335 transitions. [2019-12-27 21:35:59,784 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 53335 transitions. Word has length 33 [2019-12-27 21:35:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:59,784 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 53335 transitions. [2019-12-27 21:35:59,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:35:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 53335 transitions. [2019-12-27 21:35:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:35:59,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:59,804 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] [2019-12-27 21:35:59,805 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:35:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1052383531, now seen corresponding path program 2 times [2019-12-27 21:35:59,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:59,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849904423] [2019-12-27 21:35:59,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:59,931 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-27 21:35:59,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849904423] [2019-12-27 21:35:59,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:59,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:35:59,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871303866] [2019-12-27 21:35:59,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:59,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:59,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 85 transitions. [2019-12-27 21:35:59,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:59,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:59,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:35:59,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:35:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:35:59,962 INFO L87 Difference]: Start difference. First operand 17725 states and 53335 transitions. Second operand 7 states. [2019-12-27 21:36:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:01,251 INFO L93 Difference]: Finished difference Result 24587 states and 72060 transitions. [2019-12-27 21:36:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:36:01,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:36:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:01,284 INFO L225 Difference]: With dead ends: 24587 [2019-12-27 21:36:01,284 INFO L226 Difference]: Without dead ends: 24587 [2019-12-27 21:36:01,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:36:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-12-27 21:36:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 16954. [2019-12-27 21:36:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 21:36:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 21:36:01,822 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 21:36:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:01,822 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 21:36:01,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:36:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 21:36:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:36:01,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:01,843 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] [2019-12-27 21:36:01,843 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 21:36:01,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:01,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264683694] [2019-12-27 21:36:01,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:01,937 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-27 21:36:01,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264683694] [2019-12-27 21:36:01,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:01,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:36:01,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [319810091] [2019-12-27 21:36:01,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:01,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:02,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 21:36:02,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:02,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:36:02,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:36:02,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:02,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:36:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:36:02,206 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 11 states. [2019-12-27 21:36:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:03,126 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-27 21:36:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:36:03,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 21:36:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:03,161 INFO L225 Difference]: With dead ends: 23664 [2019-12-27 21:36:03,161 INFO L226 Difference]: Without dead ends: 23664 [2019-12-27 21:36:03,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:36:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-27 21:36:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-27 21:36:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-27 21:36:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-27 21:36:03,494 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-27 21:36:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:03,494 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-27 21:36:03,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:36:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-27 21:36:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:36:03,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:03,520 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] [2019-12-27 21:36:03,520 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-27 21:36:03,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:03,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371093912] [2019-12-27 21:36:03,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:03,584 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-27 21:36:03,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371093912] [2019-12-27 21:36:03,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:03,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:36:03,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946673874] [2019-12-27 21:36:03,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:03,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:03,659 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 21:36:03,659 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:03,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:36:03,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:36:03,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:03,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:36:03,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:36:03,724 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 7 states. [2019-12-27 21:36:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:03,874 INFO L93 Difference]: Finished difference Result 20882 states and 63572 transitions. [2019-12-27 21:36:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:36:03,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:36:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:03,921 INFO L225 Difference]: With dead ends: 20882 [2019-12-27 21:36:03,922 INFO L226 Difference]: Without dead ends: 20882 [2019-12-27 21:36:03,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:36:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20882 states. [2019-12-27 21:36:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20882 to 20042. [2019-12-27 21:36:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-27 21:36:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 61305 transitions. [2019-12-27 21:36:04,684 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 61305 transitions. Word has length 39 [2019-12-27 21:36:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:04,684 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 61305 transitions. [2019-12-27 21:36:04,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:36:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 61305 transitions. [2019-12-27 21:36:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:36:04,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:04,706 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] [2019-12-27 21:36:04,706 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 480370435, now seen corresponding path program 1 times [2019-12-27 21:36:04,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:04,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255009567] [2019-12-27 21:36:04,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:04,777 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-27 21:36:04,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255009567] [2019-12-27 21:36:04,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:04,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:36:04,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772323649] [2019-12-27 21:36:04,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:04,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:05,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 21:36:05,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:05,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:36:05,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:36:05,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:36:05,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:05,046 INFO L87 Difference]: Start difference. First operand 20042 states and 61305 transitions. Second operand 3 states. [2019-12-27 21:36:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:05,182 INFO L93 Difference]: Finished difference Result 29777 states and 91217 transitions. [2019-12-27 21:36:05,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:36:05,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:36:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:05,223 INFO L225 Difference]: With dead ends: 29777 [2019-12-27 21:36:05,223 INFO L226 Difference]: Without dead ends: 29777 [2019-12-27 21:36:05,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29777 states. [2019-12-27 21:36:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29777 to 22663. [2019-12-27 21:36:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22663 states. [2019-12-27 21:36:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22663 states to 22663 states and 70163 transitions. [2019-12-27 21:36:05,600 INFO L78 Accepts]: Start accepts. Automaton has 22663 states and 70163 transitions. Word has length 64 [2019-12-27 21:36:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:05,600 INFO L462 AbstractCegarLoop]: Abstraction has 22663 states and 70163 transitions. [2019-12-27 21:36:05,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:36:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22663 states and 70163 transitions. [2019-12-27 21:36:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:36:05,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:05,633 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] [2019-12-27 21:36:05,633 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2036276616, now seen corresponding path program 1 times [2019-12-27 21:36:05,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:05,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100149198] [2019-12-27 21:36:05,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:36:05,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100149198] [2019-12-27 21:36:05,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:05,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:36:05,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775372688] [2019-12-27 21:36:05,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:05,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:06,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 21:36:06,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:06,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:36:06,489 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 21:36:06,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:36:06,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:06,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:36:06,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:36:06,490 INFO L87 Difference]: Start difference. First operand 22663 states and 70163 transitions. Second operand 8 states. [2019-12-27 21:36:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:07,531 INFO L93 Difference]: Finished difference Result 67977 states and 214677 transitions. [2019-12-27 21:36:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:36:07,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 21:36:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:07,602 INFO L225 Difference]: With dead ends: 67977 [2019-12-27 21:36:07,603 INFO L226 Difference]: Without dead ends: 45129 [2019-12-27 21:36:07,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:36:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45129 states. [2019-12-27 21:36:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45129 to 25327. [2019-12-27 21:36:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25327 states. [2019-12-27 21:36:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25327 states to 25327 states and 80143 transitions. [2019-12-27 21:36:08,138 INFO L78 Accepts]: Start accepts. Automaton has 25327 states and 80143 transitions. Word has length 64 [2019-12-27 21:36:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:08,139 INFO L462 AbstractCegarLoop]: Abstraction has 25327 states and 80143 transitions. [2019-12-27 21:36:08,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:36:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 25327 states and 80143 transitions. [2019-12-27 21:36:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:36:08,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:08,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:36:08,176 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1674677294, now seen corresponding path program 2 times [2019-12-27 21:36:08,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:08,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739263441] [2019-12-27 21:36:08,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:08,265 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-27 21:36:08,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739263441] [2019-12-27 21:36:08,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:08,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:08,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126143809] [2019-12-27 21:36:08,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:08,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:08,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 417 transitions. [2019-12-27 21:36:08,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:08,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:36:08,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:36:08,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:36:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:36:08,979 INFO L87 Difference]: Start difference. First operand 25327 states and 80143 transitions. Second operand 11 states. [2019-12-27 21:36:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:09,712 INFO L93 Difference]: Finished difference Result 70060 states and 217075 transitions. [2019-12-27 21:36:09,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:36:09,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:36:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:09,787 INFO L225 Difference]: With dead ends: 70060 [2019-12-27 21:36:09,788 INFO L226 Difference]: Without dead ends: 48367 [2019-12-27 21:36:09,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:36:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48367 states. [2019-12-27 21:36:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48367 to 28699. [2019-12-27 21:36:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28699 states. [2019-12-27 21:36:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28699 states to 28699 states and 90519 transitions. [2019-12-27 21:36:10,378 INFO L78 Accepts]: Start accepts. Automaton has 28699 states and 90519 transitions. Word has length 64 [2019-12-27 21:36:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:10,378 INFO L462 AbstractCegarLoop]: Abstraction has 28699 states and 90519 transitions. [2019-12-27 21:36:10,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:36:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 28699 states and 90519 transitions. [2019-12-27 21:36:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:36:10,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:10,409 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] [2019-12-27 21:36:10,409 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 3 times [2019-12-27 21:36:10,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:10,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72730068] [2019-12-27 21:36:10,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:36:10,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72730068] [2019-12-27 21:36:10,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:10,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:10,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1900516944] [2019-12-27 21:36:10,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:10,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:10,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 21:36:10,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:11,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:36:11,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:36:11,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:36:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:36:11,062 INFO L87 Difference]: Start difference. First operand 28699 states and 90519 transitions. Second operand 10 states. [2019-12-27 21:36:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:12,673 INFO L93 Difference]: Finished difference Result 142729 states and 437290 transitions. [2019-12-27 21:36:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:36:12,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:36:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:12,854 INFO L225 Difference]: With dead ends: 142729 [2019-12-27 21:36:12,854 INFO L226 Difference]: Without dead ends: 110560 [2019-12-27 21:36:12,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:36:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110560 states. [2019-12-27 21:36:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110560 to 33636. [2019-12-27 21:36:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33636 states. [2019-12-27 21:36:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33636 states to 33636 states and 106344 transitions. [2019-12-27 21:36:14,361 INFO L78 Accepts]: Start accepts. Automaton has 33636 states and 106344 transitions. Word has length 64 [2019-12-27 21:36:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:14,362 INFO L462 AbstractCegarLoop]: Abstraction has 33636 states and 106344 transitions. [2019-12-27 21:36:14,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:36:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 33636 states and 106344 transitions. [2019-12-27 21:36:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:36:14,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:14,400 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] [2019-12-27 21:36:14,400 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 4 times [2019-12-27 21:36:14,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:14,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140053984] [2019-12-27 21:36:14,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:36:14,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140053984] [2019-12-27 21:36:14,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:14,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:14,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543391141] [2019-12-27 21:36:14,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:14,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:14,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 21:36:14,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:14,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:36:14,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:36:14,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:14,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:36:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:36:14,874 INFO L87 Difference]: Start difference. First operand 33636 states and 106344 transitions. Second operand 11 states. [2019-12-27 21:36:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:17,216 INFO L93 Difference]: Finished difference Result 94309 states and 291967 transitions. [2019-12-27 21:36:17,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:36:17,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:36:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:17,366 INFO L225 Difference]: With dead ends: 94309 [2019-12-27 21:36:17,366 INFO L226 Difference]: Without dead ends: 82051 [2019-12-27 21:36:17,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:36:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82051 states. [2019-12-27 21:36:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82051 to 34133. [2019-12-27 21:36:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34133 states. [2019-12-27 21:36:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34133 states to 34133 states and 107975 transitions. [2019-12-27 21:36:18,271 INFO L78 Accepts]: Start accepts. Automaton has 34133 states and 107975 transitions. Word has length 64 [2019-12-27 21:36:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:18,271 INFO L462 AbstractCegarLoop]: Abstraction has 34133 states and 107975 transitions. [2019-12-27 21:36:18,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:36:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 34133 states and 107975 transitions. [2019-12-27 21:36:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:36:18,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:18,311 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] [2019-12-27 21:36:18,312 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1853608678, now seen corresponding path program 5 times [2019-12-27 21:36:18,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:18,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523854793] [2019-12-27 21:36:18,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:18,371 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-27 21:36:18,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523854793] [2019-12-27 21:36:18,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:18,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:36:18,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182430824] [2019-12-27 21:36:18,372 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:18,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:18,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 354 transitions. [2019-12-27 21:36:18,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:18,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:36:18,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:36:18,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:36:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:18,590 INFO L87 Difference]: Start difference. First operand 34133 states and 107975 transitions. Second operand 3 states. [2019-12-27 21:36:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:18,782 INFO L93 Difference]: Finished difference Result 40618 states and 127472 transitions. [2019-12-27 21:36:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:36:18,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:36:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:18,843 INFO L225 Difference]: With dead ends: 40618 [2019-12-27 21:36:18,843 INFO L226 Difference]: Without dead ends: 40618 [2019-12-27 21:36:18,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40618 states. [2019-12-27 21:36:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40618 to 30836. [2019-12-27 21:36:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 21:36:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 21:36:19,686 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 64 [2019-12-27 21:36:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:19,686 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 21:36:19,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:36:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 21:36:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:19,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:19,720 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-27 21:36:19,720 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 21:36:19,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:19,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562595477] [2019-12-27 21:36:19,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:19,787 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-27 21:36:19,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562595477] [2019-12-27 21:36:19,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:19,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:36:19,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526066402] [2019-12-27 21:36:19,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:19,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:20,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 21:36:20,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:20,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:36:20,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:36:20,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:36:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:36:20,152 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 6 states. [2019-12-27 21:36:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:20,869 INFO L93 Difference]: Finished difference Result 54733 states and 169886 transitions. [2019-12-27 21:36:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:36:20,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 21:36:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:20,954 INFO L225 Difference]: With dead ends: 54733 [2019-12-27 21:36:20,954 INFO L226 Difference]: Without dead ends: 54733 [2019-12-27 21:36:20,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:36:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54733 states. [2019-12-27 21:36:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54733 to 31050. [2019-12-27 21:36:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31050 states. [2019-12-27 21:36:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31050 states to 31050 states and 96522 transitions. [2019-12-27 21:36:21,995 INFO L78 Accepts]: Start accepts. Automaton has 31050 states and 96522 transitions. Word has length 65 [2019-12-27 21:36:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:21,995 INFO L462 AbstractCegarLoop]: Abstraction has 31050 states and 96522 transitions. [2019-12-27 21:36:21,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:36:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31050 states and 96522 transitions. [2019-12-27 21:36:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:22,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:22,029 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-27 21:36:22,029 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:22,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 2 times [2019-12-27 21:36:22,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:22,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752950420] [2019-12-27 21:36:22,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:22,098 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-27 21:36:22,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752950420] [2019-12-27 21:36:22,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:22,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:22,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1627693166] [2019-12-27 21:36:22,099 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:22,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:22,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 497 transitions. [2019-12-27 21:36:22,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:22,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:36:22,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:36:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:36:22,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:36:22,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:36:22,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:36:22,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:36:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:36:22,611 INFO L87 Difference]: Start difference. First operand 31050 states and 96522 transitions. Second operand 12 states. [2019-12-27 21:36:24,870 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 21:36:25,809 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 21:36:26,961 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:36:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:30,057 INFO L93 Difference]: Finished difference Result 145008 states and 441349 transitions. [2019-12-27 21:36:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 21:36:30,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:36:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:30,254 INFO L225 Difference]: With dead ends: 145008 [2019-12-27 21:36:30,255 INFO L226 Difference]: Without dead ends: 119327 [2019-12-27 21:36:30,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=784, Invalid=3376, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:36:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119327 states. [2019-12-27 21:36:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119327 to 31635. [2019-12-27 21:36:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-12-27 21:36:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 98776 transitions. [2019-12-27 21:36:31,990 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 98776 transitions. Word has length 65 [2019-12-27 21:36:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:31,990 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 98776 transitions. [2019-12-27 21:36:31,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:36:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 98776 transitions. [2019-12-27 21:36:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:32,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:32,024 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-27 21:36:32,024 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 21:36:32,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:32,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799096535] [2019-12-27 21:36:32,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:32,102 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-27 21:36:32,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799096535] [2019-12-27 21:36:32,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:32,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:36:32,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784975075] [2019-12-27 21:36:32,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:32,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:32,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 21:36:32,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:32,377 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:36:32,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:36:32,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:36:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:36:32,378 INFO L87 Difference]: Start difference. First operand 31635 states and 98776 transitions. Second operand 5 states. [2019-12-27 21:36:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:33,038 INFO L93 Difference]: Finished difference Result 48003 states and 146796 transitions. [2019-12-27 21:36:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:36:33,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:36:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:33,109 INFO L225 Difference]: With dead ends: 48003 [2019-12-27 21:36:33,110 INFO L226 Difference]: Without dead ends: 47783 [2019-12-27 21:36:33,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:36:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47783 states. [2019-12-27 21:36:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47783 to 37821. [2019-12-27 21:36:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37821 states. [2019-12-27 21:36:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37821 states to 37821 states and 117767 transitions. [2019-12-27 21:36:33,788 INFO L78 Accepts]: Start accepts. Automaton has 37821 states and 117767 transitions. Word has length 65 [2019-12-27 21:36:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:33,789 INFO L462 AbstractCegarLoop]: Abstraction has 37821 states and 117767 transitions. [2019-12-27 21:36:33,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:36:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37821 states and 117767 transitions. [2019-12-27 21:36:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:33,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:33,833 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-27 21:36:33,833 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 21:36:33,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:33,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677389374] [2019-12-27 21:36:33,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:36:33,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677389374] [2019-12-27 21:36:33,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:33,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:36:33,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277439025] [2019-12-27 21:36:33,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:34,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:34,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 21:36:34,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:34,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:36:34,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:36:34,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:36:34,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:36:34,769 INFO L87 Difference]: Start difference. First operand 37821 states and 117767 transitions. Second operand 13 states. [2019-12-27 21:36:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:38,084 INFO L93 Difference]: Finished difference Result 72164 states and 220001 transitions. [2019-12-27 21:36:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:36:38,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 21:36:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:38,199 INFO L225 Difference]: With dead ends: 72164 [2019-12-27 21:36:38,199 INFO L226 Difference]: Without dead ends: 72038 [2019-12-27 21:36:38,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:36:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2019-12-27 21:36:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 40078. [2019-12-27 21:36:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40078 states. [2019-12-27 21:36:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40078 states to 40078 states and 124479 transitions. [2019-12-27 21:36:39,089 INFO L78 Accepts]: Start accepts. Automaton has 40078 states and 124479 transitions. Word has length 65 [2019-12-27 21:36:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:39,089 INFO L462 AbstractCegarLoop]: Abstraction has 40078 states and 124479 transitions. [2019-12-27 21:36:39,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:36:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40078 states and 124479 transitions. [2019-12-27 21:36:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:39,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:39,134 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-27 21:36:39,134 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 21:36:39,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:39,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262455543] [2019-12-27 21:36:39,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:39,199 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-27 21:36:39,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262455543] [2019-12-27 21:36:39,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:39,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:36:39,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [41865430] [2019-12-27 21:36:39,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:39,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:39,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 248 transitions. [2019-12-27 21:36:39,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:39,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:36:39,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:36:39,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:36:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:39,672 INFO L87 Difference]: Start difference. First operand 40078 states and 124479 transitions. Second operand 3 states. [2019-12-27 21:36:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:39,799 INFO L93 Difference]: Finished difference Result 40078 states and 124478 transitions. [2019-12-27 21:36:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:36:39,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:36:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:39,860 INFO L225 Difference]: With dead ends: 40078 [2019-12-27 21:36:39,860 INFO L226 Difference]: Without dead ends: 40078 [2019-12-27 21:36:39,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-27 21:36:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40078 states. [2019-12-27 21:36:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40078 to 34314. [2019-12-27 21:36:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34314 states. [2019-12-27 21:36:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34314 states to 34314 states and 108274 transitions. [2019-12-27 21:36:40,452 INFO L78 Accepts]: Start accepts. Automaton has 34314 states and 108274 transitions. Word has length 65 [2019-12-27 21:36:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:40,452 INFO L462 AbstractCegarLoop]: Abstraction has 34314 states and 108274 transitions. [2019-12-27 21:36:40,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:36:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 34314 states and 108274 transitions. [2019-12-27 21:36:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:36:40,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:40,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:36:40,491 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-27 21:36:40,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:40,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607248924] [2019-12-27 21:36:40,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:40,557 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-27 21:36:40,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607248924] [2019-12-27 21:36:40,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:40,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:36:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858026681] [2019-12-27 21:36:40,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:40,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:40,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 274 transitions. [2019-12-27 21:36:40,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:40,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:36:40,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:36:40,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:36:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:40,764 INFO L87 Difference]: Start difference. First operand 34314 states and 108274 transitions. Second operand 3 states. [2019-12-27 21:36:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:40,855 INFO L93 Difference]: Finished difference Result 27420 states and 84943 transitions. [2019-12-27 21:36:40,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:36:40,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:36:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:40,894 INFO L225 Difference]: With dead ends: 27420 [2019-12-27 21:36:40,894 INFO L226 Difference]: Without dead ends: 27420 [2019-12-27 21:36:40,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27420 states. [2019-12-27 21:36:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27420 to 26306. [2019-12-27 21:36:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26306 states. [2019-12-27 21:36:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26306 states to 26306 states and 81388 transitions. [2019-12-27 21:36:41,282 INFO L78 Accepts]: Start accepts. Automaton has 26306 states and 81388 transitions. Word has length 66 [2019-12-27 21:36:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:41,282 INFO L462 AbstractCegarLoop]: Abstraction has 26306 states and 81388 transitions. [2019-12-27 21:36:41,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:36:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26306 states and 81388 transitions. [2019-12-27 21:36:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:36:41,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:41,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:36:41,311 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:36:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 21:36:41,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:41,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539903792] [2019-12-27 21:36:41,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:42,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-27 21:36:42,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539903792] [2019-12-27 21:36:42,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:42,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 21:36:42,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002372885] [2019-12-27 21:36:42,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:42,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:42,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 21:36:42,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:43,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 21:36:43,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 21:36:43,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 21:36:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 21:36:44,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 21:36:44,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:36:44,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 21:36:44,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 21:36:44,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 21:36:44,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 21:36:44,576 INFO L87 Difference]: Start difference. First operand 26306 states and 81388 transitions. Second operand 35 states. [2019-12-27 21:36:51,953 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-12-27 21:37:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:04,141 INFO L93 Difference]: Finished difference Result 55254 states and 167800 transitions. [2019-12-27 21:37:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 21:37:04,142 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-12-27 21:37:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:04,214 INFO L225 Difference]: With dead ends: 55254 [2019-12-27 21:37:04,215 INFO L226 Difference]: Without dead ends: 48579 [2019-12-27 21:37:04,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 10 SyntacticMatches, 18 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4630 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2053, Invalid=12709, Unknown=0, NotChecked=0, Total=14762 [2019-12-27 21:37:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48579 states. [2019-12-27 21:37:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48579 to 27400. [2019-12-27 21:37:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27400 states. [2019-12-27 21:37:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27400 states to 27400 states and 84355 transitions. [2019-12-27 21:37:04,944 INFO L78 Accepts]: Start accepts. Automaton has 27400 states and 84355 transitions. Word has length 67 [2019-12-27 21:37:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:04,944 INFO L462 AbstractCegarLoop]: Abstraction has 27400 states and 84355 transitions. [2019-12-27 21:37:04,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 21:37:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 27400 states and 84355 transitions. [2019-12-27 21:37:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:37:04,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:04,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:04,973 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 2 times [2019-12-27 21:37:04,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:04,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245445380] [2019-12-27 21:37:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:05,338 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-27 21:37:05,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245445380] [2019-12-27 21:37:05,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:05,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:37:05,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1825125955] [2019-12-27 21:37:05,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:05,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:05,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 356 states and 741 transitions. [2019-12-27 21:37:05,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:06,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:37:07,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:37:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:37:07,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:37:08,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 49 times. [2019-12-27 21:37:08,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 21:37:08,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 21:37:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:37:08,539 INFO L87 Difference]: Start difference. First operand 27400 states and 84355 transitions. Second operand 33 states. [2019-12-27 21:37:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:42,018 INFO L93 Difference]: Finished difference Result 123255 states and 373771 transitions. [2019-12-27 21:37:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-12-27 21:37:42,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-12-27 21:37:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:42,181 INFO L225 Difference]: With dead ends: 123255 [2019-12-27 21:37:42,181 INFO L226 Difference]: Without dead ends: 104550 [2019-12-27 21:37:42,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 16 SyntacticMatches, 17 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19864 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=6658, Invalid=46012, Unknown=0, NotChecked=0, Total=52670 [2019-12-27 21:37:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104550 states. [2019-12-27 21:37:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104550 to 39457. [2019-12-27 21:37:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39457 states. [2019-12-27 21:37:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39457 states to 39457 states and 122117 transitions. [2019-12-27 21:37:43,251 INFO L78 Accepts]: Start accepts. Automaton has 39457 states and 122117 transitions. Word has length 67 [2019-12-27 21:37:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:43,251 INFO L462 AbstractCegarLoop]: Abstraction has 39457 states and 122117 transitions. [2019-12-27 21:37:43,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 21:37:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 39457 states and 122117 transitions. [2019-12-27 21:37:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:37:43,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:43,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:43,302 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 3 times [2019-12-27 21:37:43,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:43,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999528355] [2019-12-27 21:37:43,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:43,726 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-27 21:37:43,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999528355] [2019-12-27 21:37:43,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:43,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:37:43,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075820445] [2019-12-27 21:37:43,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:43,744 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:44,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 364 states and 767 transitions. [2019-12-27 21:37:44,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:45,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:37:45,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:37:45,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:37:45,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:37:46,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 54 times. [2019-12-27 21:37:46,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 21:37:46,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 21:37:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:37:46,359 INFO L87 Difference]: Start difference. First operand 39457 states and 122117 transitions. Second operand 34 states. [2019-12-27 21:38:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:22,397 INFO L93 Difference]: Finished difference Result 107171 states and 324010 transitions. [2019-12-27 21:38:22,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-12-27 21:38:22,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 21:38:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:22,566 INFO L225 Difference]: With dead ends: 107171 [2019-12-27 21:38:22,566 INFO L226 Difference]: Without dead ends: 106068 [2019-12-27 21:38:22,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 19 SyntacticMatches, 22 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12716 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=4106, Invalid=32184, Unknown=0, NotChecked=0, Total=36290 [2019-12-27 21:38:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106068 states. [2019-12-27 21:38:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106068 to 39661. [2019-12-27 21:38:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39661 states. [2019-12-27 21:38:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39661 states to 39661 states and 122731 transitions. [2019-12-27 21:38:24,026 INFO L78 Accepts]: Start accepts. Automaton has 39661 states and 122731 transitions. Word has length 67 [2019-12-27 21:38:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:24,026 INFO L462 AbstractCegarLoop]: Abstraction has 39661 states and 122731 transitions. [2019-12-27 21:38:24,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 21:38:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39661 states and 122731 transitions. [2019-12-27 21:38:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:38:24,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:24,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:24,071 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1517708504, now seen corresponding path program 4 times [2019-12-27 21:38:24,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:24,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872384226] [2019-12-27 21:38:24,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:24,175 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-27 21:38:24,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872384226] [2019-12-27 21:38:24,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:24,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:38:24,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611643502] [2019-12-27 21:38:24,176 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:24,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:24,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 592 transitions. [2019-12-27 21:38:24,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:24,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:24,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:38:24,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:38:24,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:38:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:38:24,725 INFO L87 Difference]: Start difference. First operand 39661 states and 122731 transitions. Second operand 13 states. [2019-12-27 21:38:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:26,833 INFO L93 Difference]: Finished difference Result 63105 states and 193452 transitions. [2019-12-27 21:38:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:38:26,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 21:38:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:26,917 INFO L225 Difference]: With dead ends: 63105 [2019-12-27 21:38:26,917 INFO L226 Difference]: Without dead ends: 51021 [2019-12-27 21:38:26,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:38:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51021 states. [2019-12-27 21:38:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51021 to 38509. [2019-12-27 21:38:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38509 states. [2019-12-27 21:38:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38509 states to 38509 states and 118691 transitions. [2019-12-27 21:38:27,619 INFO L78 Accepts]: Start accepts. Automaton has 38509 states and 118691 transitions. Word has length 67 [2019-12-27 21:38:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:27,619 INFO L462 AbstractCegarLoop]: Abstraction has 38509 states and 118691 transitions. [2019-12-27 21:38:27,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:38:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 38509 states and 118691 transitions. [2019-12-27 21:38:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:38:27,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:27,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:27,663 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash 956890400, now seen corresponding path program 5 times [2019-12-27 21:38:27,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:27,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193132954] [2019-12-27 21:38:27,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:27,770 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-27 21:38:27,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193132954] [2019-12-27 21:38:27,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:27,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:38:27,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286784359] [2019-12-27 21:38:27,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:27,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:28,282 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 548 transitions. [2019-12-27 21:38:28,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:28,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:28,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:38:28,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:38:28,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:28,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:38:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:38:28,522 INFO L87 Difference]: Start difference. First operand 38509 states and 118691 transitions. Second operand 14 states. [2019-12-27 21:38:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:30,985 INFO L93 Difference]: Finished difference Result 59833 states and 182750 transitions. [2019-12-27 21:38:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:38:30,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 21:38:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:31,065 INFO L225 Difference]: With dead ends: 59833 [2019-12-27 21:38:31,065 INFO L226 Difference]: Without dead ends: 50442 [2019-12-27 21:38:31,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:38:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50442 states. [2019-12-27 21:38:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50442 to 38265. [2019-12-27 21:38:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38265 states. [2019-12-27 21:38:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38265 states to 38265 states and 117783 transitions. [2019-12-27 21:38:31,745 INFO L78 Accepts]: Start accepts. Automaton has 38265 states and 117783 transitions. Word has length 67 [2019-12-27 21:38:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:31,745 INFO L462 AbstractCegarLoop]: Abstraction has 38265 states and 117783 transitions. [2019-12-27 21:38:31,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:38:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38265 states and 117783 transitions. [2019-12-27 21:38:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:38:31,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:31,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:31,788 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 13288488, now seen corresponding path program 6 times [2019-12-27 21:38:31,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:31,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258478534] [2019-12-27 21:38:31,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:32,157 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-27 21:38:32,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258478534] [2019-12-27 21:38:32,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:32,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:38:32,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788613038] [2019-12-27 21:38:32,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:32,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:32,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 584 transitions. [2019-12-27 21:38:32,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:33,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:38:33,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:38:33,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:38:33,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:33,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:38:34,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 21:38:34,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 21:38:34,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 21:38:34,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 21:38:34,037 INFO L87 Difference]: Start difference. First operand 38265 states and 117783 transitions. Second operand 35 states. Received shutdown request... [2019-12-27 21:38:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 21:38:37,372 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 21:38:37,378 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 21:38:37,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:38:37 BasicIcfg [2019-12-27 21:38:37,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:38:37,380 INFO L168 Benchmark]: Toolchain (without parser) took 225170.13 ms. Allocated memory was 136.8 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,380 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.17 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 99.3 MB in the beginning and 155.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.18 ms. Allocated memory is still 202.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,381 INFO L168 Benchmark]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,382 INFO L168 Benchmark]: RCFGBuilder took 884.84 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 100.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,382 INFO L168 Benchmark]: TraceAbstraction took 223293.79 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 21:38:37,385 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 880.17 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 99.3 MB in the beginning and 155.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.18 ms. Allocated memory is still 202.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.84 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 100.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223293.79 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (38265states) and FLOYD_HOARE automaton (currently 31 states, 35 states before enhancement),while ReachableStatesComputation was computing reachable states (618 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (38265states) and FLOYD_HOARE automaton (currently 31 states, 35 states before enhancement),while ReachableStatesComputation was computing reachable states (618 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: TIMEOUT, OverallTime: 223.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 132.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8126 SDtfs, 18404 SDslu, 39637 SDs, 0 SdLazy, 57669 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 71.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1276 GetRequests, 211 SyntacticMatches, 161 SemanticMatches, 904 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40019 ImplicationChecksByTransitivity, 43.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 579520 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1438 NumberOfCodeBlocks, 1438 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1409 ConstructedInterpolants, 0 QuantifiedInterpolants, 348151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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 could not prove your program: Timeout Completed graceful shutdown