/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:31:45,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:31:45,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:31:45,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:31:45,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:31:45,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:31:45,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:31:45,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:31:45,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:31:45,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:31:45,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:31:45,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:31:45,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:31:45,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:31:45,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:31:45,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:31:45,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:31:45,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:31:45,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:31:45,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:31:45,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:31:45,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:31:45,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:31:45,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:31:45,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:31:45,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:31:45,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:31:45,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:31:45,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:31:45,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:31:45,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:31:45,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:31:45,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:31:45,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:31:45,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:31:45,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:31:45,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:31:45,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:31:45,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:31:45,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:31:45,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:31:45,837 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-SemanticLbe-MCR.epf [2019-12-27 15:31:45,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:31:45,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:31:45,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:31:45,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:31:45,860 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:31:45,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:31:45,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:31:45,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:31:45,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:31:45,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:31:45,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:31:45,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:31:45,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:31:45,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:31:45,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:31:45,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:31:45,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:31:45,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:31:45,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:31:45,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:31:45,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:31:45,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:31:45,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:31:45,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:31:45,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:31:45,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:31:45,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:31:45,865 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:31:45,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:31:45,865 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:31:45,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:31:46,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:31:46,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:31:46,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:31:46,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:31:46,160 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:31:46,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-27 15:31:46,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c4b8c97/4a6a0108aa054722be84b374a3539855/FLAG293a9eacd [2019-12-27 15:31:46,815 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:31:46,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-27 15:31:46,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c4b8c97/4a6a0108aa054722be84b374a3539855/FLAG293a9eacd [2019-12-27 15:31:47,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c4b8c97/4a6a0108aa054722be84b374a3539855 [2019-12-27 15:31:47,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:31:47,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:31:47,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:31:47,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:31:47,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:31:47,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230b7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47, skipping insertion in model container [2019-12-27 15:31:47,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:31:47,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:31:47,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:31:47,687 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:31:47,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:31:47,903 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:31:47,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47 WrapperNode [2019-12-27 15:31:47,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:31:47,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:31:47,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:31:47,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:31:47,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:31:47,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:31:47,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:31:47,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:31:47,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:47,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:48,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (1/1) ... [2019-12-27 15:31:48,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:31:48,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:31:48,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:31:48,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:31:48,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (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 15:31:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:31:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:31:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:31:48,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:31:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:31:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:31:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:31:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:31:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:31:48,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:31:48,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:31:48,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:31:48,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:31:48,078 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 15:31:48,871 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:31:48,872 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:31:48,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:31:48 BoogieIcfgContainer [2019-12-27 15:31:48,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:31:48,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:31:48,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:31:48,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:31:48,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:31:47" (1/3) ... [2019-12-27 15:31:48,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f52d9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:31:48, skipping insertion in model container [2019-12-27 15:31:48,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:31:47" (2/3) ... [2019-12-27 15:31:48,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f52d9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:31:48, skipping insertion in model container [2019-12-27 15:31:48,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:31:48" (3/3) ... [2019-12-27 15:31:48,882 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.oepc.i [2019-12-27 15:31:48,891 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:31:48,891 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:31:48,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:31:48,900 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:31:48,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:48,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,001 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,007 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:31:49,039 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:31:49,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:31:49,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:31:49,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:31:49,060 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:31:49,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:31:49,060 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:31:49,060 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:31:49,060 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:31:49,079 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 15:31:49,081 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:31:49,190 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:31:49,190 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:31:49,207 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:31:49,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 15:31:49,291 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 15:31:49,291 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:31:49,299 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:31:49,320 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:31:49,321 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:31:54,406 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 15:31:54,564 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 15:31:54,722 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-27 15:31:54,722 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 15:31:54,726 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-27 15:32:12,859 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 15:32:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 15:32:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:32:12,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:12,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:32:12,869 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 15:32:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-27 15:32:12,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:12,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336394970] [2019-12-27 15:32:12,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:13,104 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 15:32:13,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336394970] [2019-12-27 15:32:13,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:13,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:32:13,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1156398392] [2019-12-27 15:32:13,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:13,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:13,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:32:13,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:13,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:13,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:13,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:13,140 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 15:32:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:14,480 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-27 15:32:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:14,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:32:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:18,222 INFO L225 Difference]: With dead ends: 119349 [2019-12-27 15:32:18,222 INFO L226 Difference]: Without dead ends: 112420 [2019-12-27 15:32:18,223 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 15:32:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-27 15:32:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-27 15:32:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-27 15:32:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-27 15:32:29,658 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-27 15:32:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:29,658 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-27 15:32:29,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-27 15:32:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:32:29,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:29,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:29,663 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 15:32:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-27 15:32:29,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:29,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027701000] [2019-12-27 15:32:29,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:29,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 15:32:29,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027701000] [2019-12-27 15:32:29,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:29,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:29,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525505705] [2019-12-27 15:32:29,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:29,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:29,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:32:29,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:29,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:29,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:29,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:29,795 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-27 15:32:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:35,102 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-27 15:32:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:35,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:32:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:35,787 INFO L225 Difference]: With dead ends: 179210 [2019-12-27 15:32:35,788 INFO L226 Difference]: Without dead ends: 179161 [2019-12-27 15:32:35,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:32:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-27 15:32:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-27 15:32:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-27 15:32:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-27 15:32:52,560 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-27 15:32:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:52,560 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-27 15:32:52,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-27 15:32:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:32:52,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:52,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:52,567 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 15:32:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-27 15:32:52,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:52,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76678362] [2019-12-27 15:32:52,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:52,631 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 15:32:52,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76678362] [2019-12-27 15:32:52,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:52,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:52,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527091554] [2019-12-27 15:32:52,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:52,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:52,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:32:52,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:52,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:52,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:52,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:52,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:52,637 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-27 15:32:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:52,779 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-27 15:32:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:52,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:32:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:52,832 INFO L225 Difference]: With dead ends: 34811 [2019-12-27 15:32:52,832 INFO L226 Difference]: Without dead ends: 34811 [2019-12-27 15:32:52,833 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 15:32:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-27 15:32:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-27 15:32:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-27 15:32:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-27 15:32:53,470 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-27 15:32:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:53,471 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-27 15:32:53,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-27 15:32:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:32:53,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:53,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:53,474 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 15:32:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-27 15:32:53,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:53,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226415410] [2019-12-27 15:32:53,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:32:53,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226415410] [2019-12-27 15:32:53,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:53,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:53,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78751664] [2019-12-27 15:32:53,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:53,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:53,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:32:53,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:53,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:53,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:32:53,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:32:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:32:53,633 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-27 15:32:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:55,116 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-27 15:32:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:32:55,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:32:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:55,192 INFO L225 Difference]: With dead ends: 48236 [2019-12-27 15:32:55,193 INFO L226 Difference]: Without dead ends: 48236 [2019-12-27 15:32:55,193 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 15:32:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-27 15:32:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-27 15:32:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-27 15:32:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-27 15:32:55,922 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-27 15:32:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:55,923 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-27 15:32:55,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:32:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-27 15:32:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:32:55,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:55,934 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 15:32:55,934 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 15:32:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:55,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-27 15:32:55,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:55,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134634909] [2019-12-27 15:32:55,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:56,051 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 15:32:56,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134634909] [2019-12-27 15:32:56,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:56,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:32:56,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729631282] [2019-12-27 15:32:56,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:56,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:56,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:32:56,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:56,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:56,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:56,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:56,069 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-27 15:32:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:57,550 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-27 15:32:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:32:57,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:32:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:57,654 INFO L225 Difference]: With dead ends: 62182 [2019-12-27 15:32:57,654 INFO L226 Difference]: Without dead ends: 62175 [2019-12-27 15:32:57,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:32:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-27 15:32:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-27 15:32:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-27 15:32:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-27 15:32:58,477 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-27 15:32:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:58,477 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-27 15:32:58,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:32:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-27 15:32:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:32:58,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:58,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] [2019-12-27 15:32:58,491 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 15:32:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-27 15:32:58,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:58,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594368095] [2019-12-27 15:32:58,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:58,552 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 15:32:58,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594368095] [2019-12-27 15:32:58,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:58,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:58,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090920177] [2019-12-27 15:32:58,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:58,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:58,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:32:58,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:58,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:58,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:58,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:58,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:58,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:58,570 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-27 15:32:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:58,629 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-27 15:32:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:32:58,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 15:32:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:58,651 INFO L225 Difference]: With dead ends: 16196 [2019-12-27 15:32:58,651 INFO L226 Difference]: Without dead ends: 16196 [2019-12-27 15:32:58,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-27 15:32:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-27 15:32:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-27 15:32:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-27 15:32:58,889 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-27 15:32:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:58,890 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-27 15:32:58,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:32:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-27 15:32:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:32:58,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:58,900 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 15:32:58,900 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 15:32:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-27 15:32:58,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:58,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068940247] [2019-12-27 15:32:58,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:58,950 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 15:32:58,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068940247] [2019-12-27 15:32:58,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:58,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:32:58,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298576231] [2019-12-27 15:32:58,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:58,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:58,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:32:58,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:58,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:58,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:58,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:58,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:58,966 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-27 15:32:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:59,426 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-27 15:32:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:59,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 15:32:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:59,467 INFO L225 Difference]: With dead ends: 23073 [2019-12-27 15:32:59,467 INFO L226 Difference]: Without dead ends: 23073 [2019-12-27 15:32:59,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-27 15:32:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-27 15:32:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-27 15:32:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-27 15:32:59,751 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-27 15:32:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:59,752 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-27 15:32:59,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-27 15:32:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:32:59,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:59,764 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 15:32:59,764 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 15:32:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-27 15:32:59,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:59,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098311272] [2019-12-27 15:32:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:59,841 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 15:32:59,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098311272] [2019-12-27 15:32:59,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:59,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:32:59,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137808352] [2019-12-27 15:32:59,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:59,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:59,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:32:59,852 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:59,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:59,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:32:59,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:32:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:32:59,854 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-27 15:33:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:00,388 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-27 15:33:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:33:00,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:33:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:00,437 INFO L225 Difference]: With dead ends: 24767 [2019-12-27 15:33:00,438 INFO L226 Difference]: Without dead ends: 24767 [2019-12-27 15:33:00,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:33:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-27 15:33:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-27 15:33:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-27 15:33:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-27 15:33:00,784 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-27 15:33:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:00,784 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-27 15:33:00,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:33:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-27 15:33:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:33:00,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:00,806 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 15:33:00,806 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 15:33:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-27 15:33:00,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:00,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831138630] [2019-12-27 15:33:00,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:00,900 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 15:33:00,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831138630] [2019-12-27 15:33:00,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:00,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:33:00,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053021028] [2019-12-27 15:33:00,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:00,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:00,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:33:00,919 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:00,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:00,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:33:00,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:33:00,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:00,921 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-27 15:33:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:02,134 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-27 15:33:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:33:02,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:33:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:02,172 INFO L225 Difference]: With dead ends: 27601 [2019-12-27 15:33:02,172 INFO L226 Difference]: Without dead ends: 27601 [2019-12-27 15:33:02,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:33:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-27 15:33:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-27 15:33:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-27 15:33:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-27 15:33:02,863 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-27 15:33:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:02,864 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-27 15:33:02,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:33:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-27 15:33:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:33:02,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:02,887 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 15:33:02,888 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 15:33:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:02,888 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-27 15:33:02,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:02,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139695998] [2019-12-27 15:33:02,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:02,941 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 15:33:02,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139695998] [2019-12-27 15:33:02,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:02,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:33:02,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804633532] [2019-12-27 15:33:02,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:02,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:03,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 15:33:03,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:03,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:03,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:03,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:03,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:03,006 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-27 15:33:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:03,078 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-27 15:33:03,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:03,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:33:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:03,104 INFO L225 Difference]: With dead ends: 18411 [2019-12-27 15:33:03,105 INFO L226 Difference]: Without dead ends: 18411 [2019-12-27 15:33:03,105 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 15:33:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-27 15:33:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-27 15:33:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-27 15:33:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-27 15:33:03,374 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-27 15:33:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:03,374 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-27 15:33:03,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-27 15:33:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:33:03,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:03,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:03,398 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 15:33:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-27 15:33:03,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:03,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692883861] [2019-12-27 15:33:03,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:03,496 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 15:33:03,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692883861] [2019-12-27 15:33:03,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:03,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:03,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392583045] [2019-12-27 15:33:03,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:03,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:03,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 15:33:03,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:03,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:03,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:03,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:03,606 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-27 15:33:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:03,703 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-27 15:33:03,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:03,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 15:33:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:03,749 INFO L225 Difference]: With dead ends: 18325 [2019-12-27 15:33:03,749 INFO L226 Difference]: Without dead ends: 18325 [2019-12-27 15:33:03,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-27 15:33:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-27 15:33:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-27 15:33:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-27 15:33:04,242 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-27 15:33:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:04,242 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-27 15:33:04,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-27 15:33:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:33:04,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:04,273 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] [2019-12-27 15:33:04,273 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 15:33:04,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-27 15:33:04,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:04,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399807500] [2019-12-27 15:33:04,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:04,330 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 15:33:04,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399807500] [2019-12-27 15:33:04,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:04,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:33:04,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394810311] [2019-12-27 15:33:04,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:04,339 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:04,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 417 transitions. [2019-12-27 15:33:04,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:04,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:33:04,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:33:04,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:04,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:33:04,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:33:04,975 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 6 states. [2019-12-27 15:33:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:05,081 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-27 15:33:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:05,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 15:33:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:05,112 INFO L225 Difference]: With dead ends: 15143 [2019-12-27 15:33:05,112 INFO L226 Difference]: Without dead ends: 15143 [2019-12-27 15:33:05,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:33:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-27 15:33:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-27 15:33:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-27 15:33:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-27 15:33:05,406 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-27 15:33:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:05,406 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-27 15:33:05,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:33:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-27 15:33:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:05,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:05,422 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 15:33:05,422 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 15:33:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-27 15:33:05,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:05,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548898295] [2019-12-27 15:33:05,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:05,486 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 15:33:05,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548898295] [2019-12-27 15:33:05,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:05,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:05,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417750839] [2019-12-27 15:33:05,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:05,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:05,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:33:05,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:05,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:33:05,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:05,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:05,801 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-27 15:33:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:05,912 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-27 15:33:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:05,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:33:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:05,937 INFO L225 Difference]: With dead ends: 19655 [2019-12-27 15:33:05,938 INFO L226 Difference]: Without dead ends: 19655 [2019-12-27 15:33:05,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 15:33:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-27 15:33:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-27 15:33:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-27 15:33:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-27 15:33:06,215 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-27 15:33:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:06,215 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-27 15:33:06,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-27 15:33:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:06,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:06,238 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 15:33:06,238 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 15:33:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-27 15:33:06,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:06,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730120] [2019-12-27 15:33:06,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:06,337 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 15:33:06,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554730120] [2019-12-27 15:33:06,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:06,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:33:06,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083752739] [2019-12-27 15:33:06,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:06,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:07,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 574 transitions. [2019-12-27 15:33:07,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:07,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:33:07,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:07,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:07,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:07,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:07,129 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 9 states. [2019-12-27 15:33:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:10,135 INFO L93 Difference]: Finished difference Result 67643 states and 203328 transitions. [2019-12-27 15:33:10,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:33:10,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:33:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:10,213 INFO L225 Difference]: With dead ends: 67643 [2019-12-27 15:33:10,213 INFO L226 Difference]: Without dead ends: 53075 [2019-12-27 15:33:10,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:33:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53075 states. [2019-12-27 15:33:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53075 to 18596. [2019-12-27 15:33:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-27 15:33:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-27 15:33:11,222 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-27 15:33:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:11,223 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-27 15:33:11,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-27 15:33:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:11,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:11,249 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 15:33:11,250 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 15:33:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-27 15:33:11,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:11,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878178522] [2019-12-27 15:33:11,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:11,335 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 15:33:11,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878178522] [2019-12-27 15:33:11,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:11,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:33:11,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2127985808] [2019-12-27 15:33:11,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:11,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:11,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 497 transitions. [2019-12-27 15:33:11,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:11,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:11,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:33:11,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:33:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:33:11,668 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 8 states. [2019-12-27 15:33:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:14,138 INFO L93 Difference]: Finished difference Result 69175 states and 210360 transitions. [2019-12-27 15:33:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:33:14,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:33:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:14,213 INFO L225 Difference]: With dead ends: 69175 [2019-12-27 15:33:14,213 INFO L226 Difference]: Without dead ends: 48309 [2019-12-27 15:33:14,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:33:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48309 states. [2019-12-27 15:33:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48309 to 23571. [2019-12-27 15:33:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23571 states. [2019-12-27 15:33:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23571 states to 23571 states and 72094 transitions. [2019-12-27 15:33:15,249 INFO L78 Accepts]: Start accepts. Automaton has 23571 states and 72094 transitions. Word has length 65 [2019-12-27 15:33:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:15,249 INFO L462 AbstractCegarLoop]: Abstraction has 23571 states and 72094 transitions. [2019-12-27 15:33:15,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:33:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 23571 states and 72094 transitions. [2019-12-27 15:33:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:15,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:15,272 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 15:33:15,272 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 15:33:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-27 15:33:15,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:15,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535686092] [2019-12-27 15:33:15,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:15,377 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 15:33:15,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535686092] [2019-12-27 15:33:15,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:15,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:15,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776097968] [2019-12-27 15:33:15,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:15,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:15,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 310 transitions. [2019-12-27 15:33:15,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:15,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:33:15,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:33:15,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:15,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:33:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:33:15,664 INFO L87 Difference]: Start difference. First operand 23571 states and 72094 transitions. Second operand 11 states. [2019-12-27 15:33:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:18,462 INFO L93 Difference]: Finished difference Result 93089 states and 282056 transitions. [2019-12-27 15:33:18,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:33:18,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:33:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:18,596 INFO L225 Difference]: With dead ends: 93089 [2019-12-27 15:33:18,596 INFO L226 Difference]: Without dead ends: 90467 [2019-12-27 15:33:18,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 15:33:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90467 states. [2019-12-27 15:33:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90467 to 23764. [2019-12-27 15:33:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23764 states. [2019-12-27 15:33:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23764 states to 23764 states and 72954 transitions. [2019-12-27 15:33:20,028 INFO L78 Accepts]: Start accepts. Automaton has 23764 states and 72954 transitions. Word has length 65 [2019-12-27 15:33:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:20,028 INFO L462 AbstractCegarLoop]: Abstraction has 23764 states and 72954 transitions. [2019-12-27 15:33:20,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:33:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 23764 states and 72954 transitions. [2019-12-27 15:33:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:20,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:20,051 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 15:33:20,051 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 15:33:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 4 times [2019-12-27 15:33:20,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:20,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668176377] [2019-12-27 15:33:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:20,108 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 15:33:20,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668176377] [2019-12-27 15:33:20,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:20,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:20,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067240383] [2019-12-27 15:33:20,109 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:20,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:20,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 340 states and 648 transitions. [2019-12-27 15:33:20,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:20,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:33:20,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:20,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:20,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:20,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:20,438 INFO L87 Difference]: Start difference. First operand 23764 states and 72954 transitions. Second operand 3 states. [2019-12-27 15:33:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:20,548 INFO L93 Difference]: Finished difference Result 26831 states and 82437 transitions. [2019-12-27 15:33:20,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:20,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:33:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:20,583 INFO L225 Difference]: With dead ends: 26831 [2019-12-27 15:33:20,583 INFO L226 Difference]: Without dead ends: 26831 [2019-12-27 15:33:20,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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 15:33:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26831 states. [2019-12-27 15:33:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26831 to 22448. [2019-12-27 15:33:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22448 states. [2019-12-27 15:33:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 69699 transitions. [2019-12-27 15:33:20,955 INFO L78 Accepts]: Start accepts. Automaton has 22448 states and 69699 transitions. Word has length 65 [2019-12-27 15:33:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:20,955 INFO L462 AbstractCegarLoop]: Abstraction has 22448 states and 69699 transitions. [2019-12-27 15:33:20,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22448 states and 69699 transitions. [2019-12-27 15:33:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:20,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:20,981 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 15:33:20,981 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 15:33:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-27 15:33:20,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:20,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799222079] [2019-12-27 15:33:20,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:21,477 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 15:33:21,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799222079] [2019-12-27 15:33:21,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:21,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:33:21,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273369049] [2019-12-27 15:33:21,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:21,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:21,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:33:21,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:21,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:21,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:33:21,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:33:21,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:33:21,690 INFO L87 Difference]: Start difference. First operand 22448 states and 69699 transitions. Second operand 8 states. [2019-12-27 15:33:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:22,615 INFO L93 Difference]: Finished difference Result 55952 states and 170672 transitions. [2019-12-27 15:33:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:33:22,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 15:33:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:22,692 INFO L225 Difference]: With dead ends: 55952 [2019-12-27 15:33:22,692 INFO L226 Difference]: Without dead ends: 52796 [2019-12-27 15:33:22,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:33:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52796 states. [2019-12-27 15:33:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52796 to 22532. [2019-12-27 15:33:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-12-27 15:33:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 70039 transitions. [2019-12-27 15:33:23,253 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 70039 transitions. Word has length 66 [2019-12-27 15:33:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:23,253 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 70039 transitions. [2019-12-27 15:33:23,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:33:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 70039 transitions. [2019-12-27 15:33:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:23,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:23,276 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 15:33:23,276 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 15:33:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-27 15:33:23,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:23,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160806388] [2019-12-27 15:33:23,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:23,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160806388] [2019-12-27 15:33:23,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:23,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:23,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204763163] [2019-12-27 15:33:23,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:23,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:23,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 307 transitions. [2019-12-27 15:33:23,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:23,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:33:23,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:33:23,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:33:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:33:23,754 INFO L87 Difference]: Start difference. First operand 22532 states and 70039 transitions. Second operand 12 states. [2019-12-27 15:33:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:29,821 INFO L93 Difference]: Finished difference Result 98642 states and 299379 transitions. [2019-12-27 15:33:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 15:33:29,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 15:33:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:29,939 INFO L225 Difference]: With dead ends: 98642 [2019-12-27 15:33:29,940 INFO L226 Difference]: Without dead ends: 83103 [2019-12-27 15:33:29,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=840, Invalid=3990, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 15:33:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83103 states. [2019-12-27 15:33:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83103 to 24328. [2019-12-27 15:33:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24328 states. [2019-12-27 15:33:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24328 states to 24328 states and 75952 transitions. [2019-12-27 15:33:30,726 INFO L78 Accepts]: Start accepts. Automaton has 24328 states and 75952 transitions. Word has length 66 [2019-12-27 15:33:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:30,726 INFO L462 AbstractCegarLoop]: Abstraction has 24328 states and 75952 transitions. [2019-12-27 15:33:30,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:33:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 24328 states and 75952 transitions. [2019-12-27 15:33:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:31,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:31,172 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 15:33:31,172 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 15:33:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-27 15:33:31,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:31,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26323761] [2019-12-27 15:33:31,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:31,300 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 15:33:31,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26323761] [2019-12-27 15:33:31,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:31,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:31,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476478150] [2019-12-27 15:33:31,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:31,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:31,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 15:33:31,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:31,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:31,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:31,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:31,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:31,527 INFO L87 Difference]: Start difference. First operand 24328 states and 75952 transitions. Second operand 9 states. [2019-12-27 15:33:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:32,826 INFO L93 Difference]: Finished difference Result 72337 states and 218873 transitions. [2019-12-27 15:33:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:33:32,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 15:33:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:32,923 INFO L225 Difference]: With dead ends: 72337 [2019-12-27 15:33:32,923 INFO L226 Difference]: Without dead ends: 68973 [2019-12-27 15:33:32,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:33:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68973 states. [2019-12-27 15:33:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68973 to 24188. [2019-12-27 15:33:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24188 states. [2019-12-27 15:33:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24188 states to 24188 states and 75284 transitions. [2019-12-27 15:33:33,619 INFO L78 Accepts]: Start accepts. Automaton has 24188 states and 75284 transitions. Word has length 66 [2019-12-27 15:33:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:33,619 INFO L462 AbstractCegarLoop]: Abstraction has 24188 states and 75284 transitions. [2019-12-27 15:33:33,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 24188 states and 75284 transitions. [2019-12-27 15:33:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:33,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:33,643 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 15:33:33,643 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 15:33:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-27 15:33:33,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:33,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663901523] [2019-12-27 15:33:33,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:33,781 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 15:33:33,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663901523] [2019-12-27 15:33:33,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:33,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:33:33,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [433909684] [2019-12-27 15:33:33,783 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:33,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:34,733 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:33:34,734 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:35,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:33:35,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:33:35,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:33:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:33:35,020 INFO L87 Difference]: Start difference. First operand 24188 states and 75284 transitions. Second operand 13 states. [2019-12-27 15:33:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:38,605 INFO L93 Difference]: Finished difference Result 61337 states and 185557 transitions. [2019-12-27 15:33:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:33:38,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 15:33:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:38,699 INFO L225 Difference]: With dead ends: 61337 [2019-12-27 15:33:38,699 INFO L226 Difference]: Without dead ends: 61337 [2019-12-27 15:33:38,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:33:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61337 states. [2019-12-27 15:33:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61337 to 22583. [2019-12-27 15:33:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22583 states. [2019-12-27 15:33:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22583 states to 22583 states and 69137 transitions. [2019-12-27 15:33:39,357 INFO L78 Accepts]: Start accepts. Automaton has 22583 states and 69137 transitions. Word has length 66 [2019-12-27 15:33:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:39,357 INFO L462 AbstractCegarLoop]: Abstraction has 22583 states and 69137 transitions. [2019-12-27 15:33:39,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:33:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22583 states and 69137 transitions. [2019-12-27 15:33:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:39,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:39,385 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 15:33:39,385 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 15:33:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-27 15:33:39,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:39,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781863106] [2019-12-27 15:33:39,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:39,461 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 15:33:39,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781863106] [2019-12-27 15:33:39,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:39,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:39,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [543627737] [2019-12-27 15:33:39,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:39,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:40,398 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 548 transitions. [2019-12-27 15:33:40,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:40,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:33:40,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:40,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:40,407 INFO L87 Difference]: Start difference. First operand 22583 states and 69137 transitions. Second operand 4 states. [2019-12-27 15:33:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:40,611 INFO L93 Difference]: Finished difference Result 22398 states and 68401 transitions. [2019-12-27 15:33:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:33:40,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:33:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:40,666 INFO L225 Difference]: With dead ends: 22398 [2019-12-27 15:33:40,667 INFO L226 Difference]: Without dead ends: 22398 [2019-12-27 15:33:40,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 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 15:33:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22398 states. [2019-12-27 15:33:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22398 to 20584. [2019-12-27 15:33:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20584 states. [2019-12-27 15:33:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20584 states to 20584 states and 62988 transitions. [2019-12-27 15:33:41,276 INFO L78 Accepts]: Start accepts. Automaton has 20584 states and 62988 transitions. Word has length 66 [2019-12-27 15:33:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:41,277 INFO L462 AbstractCegarLoop]: Abstraction has 20584 states and 62988 transitions. [2019-12-27 15:33:41,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20584 states and 62988 transitions. [2019-12-27 15:33:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:41,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:41,313 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 15:33:41,313 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 15:33:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-27 15:33:41,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:41,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412652436] [2019-12-27 15:33:41,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:41,411 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 15:33:41,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412652436] [2019-12-27 15:33:41,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:41,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:41,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566242872] [2019-12-27 15:33:41,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:41,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:41,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 520 transitions. [2019-12-27 15:33:41,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:41,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:41,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:41,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:41,734 INFO L87 Difference]: Start difference. First operand 20584 states and 62988 transitions. Second operand 4 states. [2019-12-27 15:33:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:41,962 INFO L93 Difference]: Finished difference Result 26349 states and 78432 transitions. [2019-12-27 15:33:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:41,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:33:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:41,997 INFO L225 Difference]: With dead ends: 26349 [2019-12-27 15:33:41,998 INFO L226 Difference]: Without dead ends: 26349 [2019-12-27 15:33:41,998 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 15:33:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26349 states. [2019-12-27 15:33:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26349 to 18341. [2019-12-27 15:33:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18341 states. [2019-12-27 15:33:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 55309 transitions. [2019-12-27 15:33:42,318 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 55309 transitions. Word has length 66 [2019-12-27 15:33:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:42,318 INFO L462 AbstractCegarLoop]: Abstraction has 18341 states and 55309 transitions. [2019-12-27 15:33:42,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 55309 transitions. [2019-12-27 15:33:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:42,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:42,338 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 15:33:42,338 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 15:33:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-27 15:33:42,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:42,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903825338] [2019-12-27 15:33:42,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:42,440 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 15:33:42,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903825338] [2019-12-27 15:33:42,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:42,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:42,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459671136] [2019-12-27 15:33:42,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:42,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:42,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 334 transitions. [2019-12-27 15:33:42,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:42,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:33:42,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:42,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:42,949 INFO L87 Difference]: Start difference. First operand 18341 states and 55309 transitions. Second operand 9 states. [2019-12-27 15:33:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:44,440 INFO L93 Difference]: Finished difference Result 34193 states and 101561 transitions. [2019-12-27 15:33:44,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:33:44,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 15:33:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:44,478 INFO L225 Difference]: With dead ends: 34193 [2019-12-27 15:33:44,478 INFO L226 Difference]: Without dead ends: 28904 [2019-12-27 15:33:44,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:33:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28904 states. [2019-12-27 15:33:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28904 to 18973. [2019-12-27 15:33:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-12-27 15:33:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 56913 transitions. [2019-12-27 15:33:44,833 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 56913 transitions. Word has length 67 [2019-12-27 15:33:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:44,833 INFO L462 AbstractCegarLoop]: Abstraction has 18973 states and 56913 transitions. [2019-12-27 15:33:44,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 56913 transitions. [2019-12-27 15:33:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:44,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:44,853 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 15:33:44,853 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 15:33:44,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-27 15:33:44,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:44,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153216368] [2019-12-27 15:33:44,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:45,617 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 15:33:45,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153216368] [2019-12-27 15:33:45,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:45,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 15:33:45,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158286500] [2019-12-27 15:33:45,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:45,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:45,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 15:33:45,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:46,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:46,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:46,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:46,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:46,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:46,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:47,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:47,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:47,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 15:33:47,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 15:33:47,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 15:33:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 15:33:47,237 INFO L87 Difference]: Start difference. First operand 18973 states and 56913 transitions. Second operand 39 states. [2019-12-27 15:33:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:55,927 INFO L93 Difference]: Finished difference Result 22962 states and 67816 transitions. [2019-12-27 15:33:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 15:33:55,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 67 [2019-12-27 15:33:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:55,955 INFO L225 Difference]: With dead ends: 22962 [2019-12-27 15:33:55,955 INFO L226 Difference]: Without dead ends: 19941 [2019-12-27 15:33:55,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 15 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=743, Invalid=5419, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 15:33:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19941 states. [2019-12-27 15:33:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19941 to 19344. [2019-12-27 15:33:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19344 states. [2019-12-27 15:33:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19344 states to 19344 states and 57885 transitions. [2019-12-27 15:33:56,247 INFO L78 Accepts]: Start accepts. Automaton has 19344 states and 57885 transitions. Word has length 67 [2019-12-27 15:33:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:56,247 INFO L462 AbstractCegarLoop]: Abstraction has 19344 states and 57885 transitions. [2019-12-27 15:33:56,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 15:33:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 19344 states and 57885 transitions. [2019-12-27 15:33:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:56,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:56,268 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 15:33:56,268 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 15:33:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 739933975, now seen corresponding path program 3 times [2019-12-27 15:33:56,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:56,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998268786] [2019-12-27 15:33:56,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:56,439 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 15:33:56,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998268786] [2019-12-27 15:33:56,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:56,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:33:56,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498631205] [2019-12-27 15:33:56,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:56,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:56,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 476 transitions. [2019-12-27 15:33:56,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:56,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:33:56,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:33:56,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:33:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:33:56,964 INFO L87 Difference]: Start difference. First operand 19344 states and 57885 transitions. Second operand 12 states. [2019-12-27 15:33:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:58,411 INFO L93 Difference]: Finished difference Result 24220 states and 71905 transitions. [2019-12-27 15:33:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:33:58,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:33:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:58,442 INFO L225 Difference]: With dead ends: 24220 [2019-12-27 15:33:58,442 INFO L226 Difference]: Without dead ends: 22557 [2019-12-27 15:33:58,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:33:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22557 states. [2019-12-27 15:33:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22557 to 19164. [2019-12-27 15:33:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19164 states. [2019-12-27 15:33:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19164 states to 19164 states and 57404 transitions. [2019-12-27 15:33:58,752 INFO L78 Accepts]: Start accepts. Automaton has 19164 states and 57404 transitions. Word has length 67 [2019-12-27 15:33:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:58,753 INFO L462 AbstractCegarLoop]: Abstraction has 19164 states and 57404 transitions. [2019-12-27 15:33:58,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:33:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19164 states and 57404 transitions. [2019-12-27 15:33:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:33:58,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:58,773 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 15:33:58,773 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 15:33:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 4 times [2019-12-27 15:33:58,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:58,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343825241] [2019-12-27 15:33:58,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:59,222 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 15:33:59,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343825241] [2019-12-27 15:33:59,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:59,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 15:33:59,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92253859] [2019-12-27 15:33:59,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:59,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:59,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 588 transitions. [2019-12-27 15:33:59,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:59,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:33:59,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:00,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 15:34:00,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 15:34:00,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 15:34:00,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:34:00,045 INFO L87 Difference]: Start difference. First operand 19164 states and 57404 transitions. Second operand 24 states. [2019-12-27 15:34:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:04,873 INFO L93 Difference]: Finished difference Result 29881 states and 88370 transitions. [2019-12-27 15:34:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 15:34:04,873 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 15:34:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:04,912 INFO L225 Difference]: With dead ends: 29881 [2019-12-27 15:34:04,912 INFO L226 Difference]: Without dead ends: 26938 [2019-12-27 15:34:04,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=347, Invalid=2305, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 15:34:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26938 states. [2019-12-27 15:34:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26938 to 20023. [2019-12-27 15:34:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20023 states. [2019-12-27 15:34:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20023 states to 20023 states and 59805 transitions. [2019-12-27 15:34:05,240 INFO L78 Accepts]: Start accepts. Automaton has 20023 states and 59805 transitions. Word has length 67 [2019-12-27 15:34:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:05,241 INFO L462 AbstractCegarLoop]: Abstraction has 20023 states and 59805 transitions. [2019-12-27 15:34:05,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 15:34:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20023 states and 59805 transitions. [2019-12-27 15:34:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:34:05,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:05,262 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 15:34:05,263 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 15:34:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash -909646753, now seen corresponding path program 5 times [2019-12-27 15:34:05,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:05,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731449329] [2019-12-27 15:34:05,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:05,784 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 15:34:05,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731449329] [2019-12-27 15:34:05,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:05,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 15:34:05,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1174608987] [2019-12-27 15:34:05,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:05,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:05,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 473 transitions. [2019-12-27 15:34:05,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:07,651 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-27 15:34:08,531 WARN L192 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 154 [2019-12-27 15:34:08,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-12-27 15:34:09,137 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-12-27 15:34:09,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 49 times. [2019-12-27 15:34:09,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 15:34:09,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 15:34:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 15:34:09,141 INFO L87 Difference]: Start difference. First operand 20023 states and 59805 transitions. Second operand 41 states. [2019-12-27 15:34:09,330 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-27 15:34:15,335 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2019-12-27 15:34:24,412 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-12-27 15:34:24,666 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-12-27 15:34:25,747 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-12-27 15:34:28,959 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-27 15:34:30,165 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-27 15:34:31,116 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-12-27 15:34:31,748 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-12-27 15:34:32,776 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-12-27 15:34:33,426 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-12-27 15:34:34,554 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-27 15:34:35,665 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-27 15:34:36,033 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-12-27 15:34:36,753 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-12-27 15:34:37,091 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-12-27 15:34:38,194 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 15:34:38,473 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-12-27 15:34:38,694 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-12-27 15:34:39,064 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-12-27 15:34:39,287 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-27 15:34:39,846 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-12-27 15:34:42,286 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-12-27 15:34:42,827 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 15:34:42,982 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-27 15:34:45,097 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-12-27 15:34:46,286 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-27 15:34:47,019 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-27 15:34:47,245 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-12-27 15:34:47,619 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-27 15:34:48,456 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-12-27 15:34:48,768 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 15:34:50,464 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-27 15:34:50,776 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-27 15:34:51,069 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-12-27 15:34:52,838 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-27 15:34:53,192 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-27 15:34:53,932 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-27 15:34:57,450 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-27 15:34:59,032 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-12-27 15:34:59,799 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-12-27 15:35:01,760 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-12-27 15:35:01,988 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 15:35:02,199 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-12-27 15:35:02,360 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2019-12-27 15:35:03,018 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-27 15:35:03,568 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-27 15:35:05,149 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-12-27 15:35:07,039 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-12-27 15:35:07,449 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-12-27 15:35:09,620 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-27 15:35:10,078 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-12-27 15:35:10,270 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 15:35:10,739 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-27 15:35:13,408 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-12-27 15:35:14,669 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-12-27 15:35:15,096 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-27 15:35:16,782 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-27 15:35:21,915 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-12-27 15:35:23,312 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-27 15:35:23,955 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-12-27 15:35:24,115 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 15:35:24,493 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-12-27 15:35:25,577 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-27 15:35:27,537 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-12-27 15:35:29,158 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-12-27 15:35:30,128 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-27 15:35:30,343 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 15:35:30,584 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 15:35:30,886 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-27 15:35:31,088 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 Received shutdown request... [2019-12-27 15:35:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 398 states. [2019-12-27 15:35:31,665 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 15:35:31,670 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 15:35:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:35:31 BasicIcfg [2019-12-27 15:35:31,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:35:31,672 INFO L168 Benchmark]: Toolchain (without parser) took 224595.05 ms. Allocated memory was 145.2 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 100.3 MB in the beginning and 702.7 MB in the end (delta: -602.4 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-12-27 15:35:31,672 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:35:31,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.22 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 156.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:31,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.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 15:35:31,673 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:31,674 INFO L168 Benchmark]: RCFGBuilder took 866.05 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 100.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:31,674 INFO L168 Benchmark]: TraceAbstraction took 222796.27 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.0 MB in the beginning and 702.7 MB in the end (delta: -602.7 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2019-12-27 15:35:31,676 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.22 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 156.1 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.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.01 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.05 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 100.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222796.27 ms. Allocated memory was 202.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.0 MB in the beginning and 702.7 MB in the end (delta: -602.7 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 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 (20023states) and FLOYD_HOARE automaton (currently 398 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (92026 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 (20023states) and FLOYD_HOARE automaton (currently 398 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (92026 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: TIMEOUT, OverallTime: 222.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 137.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7848 SDtfs, 16127 SDslu, 37530 SDs, 0 SdLazy, 51108 SolverSat, 2340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1130 GetRequests, 174 SyntacticMatches, 62 SemanticMatches, 894 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80644 ImplicationChecksByTransitivity, 59.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 42.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 404802 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1353 NumberOfCodeBlocks, 1353 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 373938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown