/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/mix052_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:26:44,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:26:44,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:26:44,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:26:44,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:26:44,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:26:44,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:26:44,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:26:44,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:26:44,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:26:44,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:26:44,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:26:44,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:26:44,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:26:44,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:26:44,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:26:44,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:26:44,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:26:44,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:26:44,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:26:44,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:26:44,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:26:44,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:26:44,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:26:44,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:26:44,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:26:44,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:26:44,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:26:44,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:26:44,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:26:44,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:26:44,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:26:44,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:26:44,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:26:44,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:26:44,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:26:44,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:26:44,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:26:44,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:26:44,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:26:44,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:26:44,835 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 17:26:44,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:26:44,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:26:44,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:26:44,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:26:44,851 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:26:44,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:26:44,851 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:26:44,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:26:44,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:26:44,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:26:44,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:26:44,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:26:44,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:26:44,853 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:26:44,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:26:44,853 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:26:44,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:26:44,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:26:44,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:26:44,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:26:44,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:26:44,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:26:44,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:26:44,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:26:44,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:26:44,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:26:44,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:26:44,856 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:26:44,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:26:44,856 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:26:44,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:26:45,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:26:45,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:26:45,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:26:45,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:26:45,199 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:26:45,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-27 17:26:45,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a21a025e/963697a6751f4930846fd60d8d7912c8/FLAG4d5e69f19 [2019-12-27 17:26:45,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:26:45,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-27 17:26:45,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a21a025e/963697a6751f4930846fd60d8d7912c8/FLAG4d5e69f19 [2019-12-27 17:26:46,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a21a025e/963697a6751f4930846fd60d8d7912c8 [2019-12-27 17:26:46,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:26:46,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:26:46,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:26:46,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:26:46,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:26:46,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0f289a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46, skipping insertion in model container [2019-12-27 17:26:46,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:26:46,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:26:46,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:26:46,735 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:26:46,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:26:46,891 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:26:46,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46 WrapperNode [2019-12-27 17:26:46,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:26:46,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:26:46,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:26:46,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:26:46,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:26:46,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:26:46,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:26:46,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:26:46,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:46,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:47,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:47,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:47,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (1/1) ... [2019-12-27 17:26:47,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:26:47,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:26:47,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:26:47,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:26:47,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (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 17:26:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:26:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:26:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:26:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:26:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:26:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:26:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:26:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:26:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:26:47,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:26:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:26:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:26:47,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:26:47,086 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 17:26:47,862 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:26:47,863 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:26:47,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:26:47 BoogieIcfgContainer [2019-12-27 17:26:47,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:26:47,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:26:47,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:26:47,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:26:47,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:26:46" (1/3) ... [2019-12-27 17:26:47,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3a8c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:26:47, skipping insertion in model container [2019-12-27 17:26:47,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:26:46" (2/3) ... [2019-12-27 17:26:47,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3a8c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:26:47, skipping insertion in model container [2019-12-27 17:26:47,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:26:47" (3/3) ... [2019-12-27 17:26:47,873 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.oepc.i [2019-12-27 17:26:47,884 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:26:47,884 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:26:47,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:26:47,893 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:26:47,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:47,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:26:48,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:26:48,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:26:48,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:26:48,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:26:48,055 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:26:48,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:26:48,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:26:48,056 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:26:48,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:26:48,074 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 17:26:48,076 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 17:26:48,181 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 17:26:48,181 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:26:48,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:26:48,224 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 17:26:48,290 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 17:26:48,290 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:26:48,299 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:26:48,320 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:26:48,321 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:26:53,981 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 17:26:54,106 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 17:26:54,460 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 17:26:54,461 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 17:26:54,465 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 17:27:12,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 17:27:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 17:27:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:27:12,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:12,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:27: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 17:27:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:12,874 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 17:27:12,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:12,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104935807] [2019-12-27 17:27:12,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:13,127 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 17:27:13,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104935807] [2019-12-27 17:27:13,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:13,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:27:13,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019717541] [2019-12-27 17:27:13,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:13,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:13,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:27:13,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:13,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:13,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:27:13,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:27:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:27:13,172 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 17:27:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:17,045 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 17:27:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:27:17,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:27:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:17,873 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 17:27:17,874 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 17:27:17,875 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 17:27:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 17:27:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 17:27:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 17:27:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 17:27:24,454 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 17:27:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:24,454 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 17:27:24,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:27:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 17:27:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:27:24,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:24,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:27:24,460 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 17:27:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 17:27:24,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:24,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368607582] [2019-12-27 17:27:24,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:24,546 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 17:27:24,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368607582] [2019-12-27 17:27:24,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:24,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:27:24,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057201899] [2019-12-27 17:27:24,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:24,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:24,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:27:24,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:24,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:24,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:27:24,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:27:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:27:24,559 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 17:27:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:29,221 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 17:27:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:27:29,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:27:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:30,333 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 17:27:30,333 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 17:27:30,334 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 17:27:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 17:27:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 17:27:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 17:27:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 17:27:42,487 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 17:27:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:42,487 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 17:27:42,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:27:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 17:27:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:27:42,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:42,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:27:42,494 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 17:27:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 17:27:42,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:42,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988437131] [2019-12-27 17:27:42,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:42,558 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 17:27:42,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988437131] [2019-12-27 17:27:42,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:42,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:27:42,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240334135] [2019-12-27 17:27:42,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:42,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:42,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:27:42,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:42,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:42,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:27:42,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:27:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:27:42,564 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 17:27:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:42,716 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 17:27:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:27:42,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:27:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:42,801 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 17:27:42,801 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 17:27:42,802 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 17:27:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 17:27:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 17:27:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 17:27:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 17:27:43,491 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 17:27:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:43,492 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 17:27:43,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:27:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 17:27:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:27:43,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:43,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:27:43,495 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 17:27:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 17:27:43,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:43,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101410476] [2019-12-27 17:27:43,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:43,649 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 17:27:43,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101410476] [2019-12-27 17:27:43,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:43,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:27:43,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099562252] [2019-12-27 17:27:43,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:43,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:43,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:27:43,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:43,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:43,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:27:43,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:43,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:27:43,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:27:43,657 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 17:27:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:44,159 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 17:27:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:27:44,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:27:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:44,248 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 17:27:44,248 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 17:27:44,248 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 17:27:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 17:27:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 17:27:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 17:27:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 17:27:47,265 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 17:27:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:47,266 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 17:27:47,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:27:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 17:27:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:27:47,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:47,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] [2019-12-27 17:27:47,276 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 17:27:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 17:27:47,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:47,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119218178] [2019-12-27 17:27:47,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:47,381 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 17:27:47,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119218178] [2019-12-27 17:27:47,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:47,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:27:47,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444028575] [2019-12-27 17:27:47,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:47,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:47,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 17:27:47,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:47,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:47,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:27:47,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:27:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:27:47,397 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 17:27:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:48,343 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 17:27:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:27:48,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 17:27:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:48,437 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 17:27:48,437 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 17:27:48,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:27:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 17:27:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 17:27:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 17:27:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 17:27:49,536 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 17:27:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:49,536 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 17:27:49,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:27:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 17:27:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:27:49,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:49,551 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 17:27:49,551 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 17:27:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 17:27:49,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:49,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899066722] [2019-12-27 17:27:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:49,609 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 17:27:49,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899066722] [2019-12-27 17:27:49,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:49,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:27:49,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101978937] [2019-12-27 17:27:49,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:49,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:49,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:27:49,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:49,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:27:49,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:27:49,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:27:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:27:49,667 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 5 states. [2019-12-27 17:27:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:49,757 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 17:27:49,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:27:49,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:27:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:49,784 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 17:27:49,784 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 17:27:49,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:27:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 17:27:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 17:27:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 17:27:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 17:27:50,047 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 17:27:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:50,048 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 17:27:50,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:27:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 17:27:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:27:50,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:50,059 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 17:27:50,060 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 17:27:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 17:27:50,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:50,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709247528] [2019-12-27 17:27:50,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:50,166 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 17:27:50,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709247528] [2019-12-27 17:27:50,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:50,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:27:50,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409510378] [2019-12-27 17:27:50,167 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:50,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:50,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:27:50,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:50,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:50,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:27:50,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:27:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:27:50,179 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 17:27:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:50,754 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 17:27:50,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:27:50,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:27:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:50,801 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 17:27:50,801 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 17:27:50,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:27:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 17:27:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 17:27:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 17:27:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 17:27:51,396 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 17:27:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:51,396 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 17:27:51,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:27:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 17:27:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:27:51,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:51,413 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 17:27:51,413 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 17:27:51,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 17:27:51,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:51,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785523308] [2019-12-27 17:27:51,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:51,517 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 17:27:51,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785523308] [2019-12-27 17:27:51,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:51,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:27:51,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668754711] [2019-12-27 17:27:51,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:51,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:51,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 17:27:51,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:51,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:27:51,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:27:51,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:27:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:27:51,545 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 17:27:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:52,754 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 17:27:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:27:52,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 17:27:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:52,789 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 17:27:52,789 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 17:27:52,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:27:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 17:27:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 17:27:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 17:27:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 17:27:53,100 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 17:27:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:53,100 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 17:27:53,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:27:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 17:27:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:27:53,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:53,124 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 17:27:53,124 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 17:27:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 17:27:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307493059] [2019-12-27 17:27:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:53,233 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 17:27:53,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307493059] [2019-12-27 17:27:53,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:53,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:27:53,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919570927] [2019-12-27 17:27:53,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:53,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:53,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 17:27:53,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:53,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:27:53,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:27:53,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:27:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:27:53,503 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 11 states. [2019-12-27 17:27:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:54,432 INFO L93 Difference]: Finished difference Result 23224 states and 69393 transitions. [2019-12-27 17:27:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:27:54,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 17:27:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:54,463 INFO L225 Difference]: With dead ends: 23224 [2019-12-27 17:27:54,463 INFO L226 Difference]: Without dead ends: 23224 [2019-12-27 17:27:54,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:27:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23224 states. [2019-12-27 17:27:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23224 to 21703. [2019-12-27 17:27:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21703 states. [2019-12-27 17:27:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21703 states to 21703 states and 65239 transitions. [2019-12-27 17:27:54,893 INFO L78 Accepts]: Start accepts. Automaton has 21703 states and 65239 transitions. Word has length 39 [2019-12-27 17:27:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:54,893 INFO L462 AbstractCegarLoop]: Abstraction has 21703 states and 65239 transitions. [2019-12-27 17:27:54,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:27:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21703 states and 65239 transitions. [2019-12-27 17:27:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:27:54,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:54,923 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 17:27:54,923 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 17:27:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash -589002614, now seen corresponding path program 2 times [2019-12-27 17:27:54,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:54,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80282947] [2019-12-27 17:27:54,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:27:54,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80282947] [2019-12-27 17:27:54,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:54,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:27:54,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120320214] [2019-12-27 17:27:54,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:54,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:55,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 314 transitions. [2019-12-27 17:27:55,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:55,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:27:55,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:27:55,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:27:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:27:55,089 INFO L87 Difference]: Start difference. First operand 21703 states and 65239 transitions. Second operand 7 states. [2019-12-27 17:27:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:55,189 INFO L93 Difference]: Finished difference Result 20476 states and 62395 transitions. [2019-12-27 17:27:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:27:55,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 17:27:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:55,218 INFO L225 Difference]: With dead ends: 20476 [2019-12-27 17:27:55,219 INFO L226 Difference]: Without dead ends: 20476 [2019-12-27 17:27:55,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:27:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2019-12-27 17:27:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19636. [2019-12-27 17:27:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19636 states. [2019-12-27 17:27:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19636 states to 19636 states and 60128 transitions. [2019-12-27 17:27:55,515 INFO L78 Accepts]: Start accepts. Automaton has 19636 states and 60128 transitions. Word has length 39 [2019-12-27 17:27:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:55,516 INFO L462 AbstractCegarLoop]: Abstraction has 19636 states and 60128 transitions. [2019-12-27 17:27:55,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:27:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 19636 states and 60128 transitions. [2019-12-27 17:27:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:27:55,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:55,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:27:55,537 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 17:27:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-27 17:27:55,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:55,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342280327] [2019-12-27 17:27:55,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:55,599 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 17:27:55,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342280327] [2019-12-27 17:27:55,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:55,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:27:55,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1709664698] [2019-12-27 17:27:55,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:55,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:56,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 17:27:56,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:56,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:27:56,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:27:56,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:56,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:27:56,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:27:56,028 INFO L87 Difference]: Start difference. First operand 19636 states and 60128 transitions. Second operand 3 states. [2019-12-27 17:27:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:56,143 INFO L93 Difference]: Finished difference Result 29371 states and 90040 transitions. [2019-12-27 17:27:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:27:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:27:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:56,184 INFO L225 Difference]: With dead ends: 29371 [2019-12-27 17:27:56,184 INFO L226 Difference]: Without dead ends: 29371 [2019-12-27 17:27:56,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:27:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29371 states. [2019-12-27 17:27:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29371 to 22257. [2019-12-27 17:27:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22257 states. [2019-12-27 17:27:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22257 states to 22257 states and 68986 transitions. [2019-12-27 17:27:56,598 INFO L78 Accepts]: Start accepts. Automaton has 22257 states and 68986 transitions. Word has length 64 [2019-12-27 17:27:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:56,598 INFO L462 AbstractCegarLoop]: Abstraction has 22257 states and 68986 transitions. [2019-12-27 17:27:56,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:27:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22257 states and 68986 transitions. [2019-12-27 17:27:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:27:56,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:56,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:27:56,626 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 17:27:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-27 17:27:56,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:56,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85981895] [2019-12-27 17:27:56,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:56,714 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 17:27:56,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85981895] [2019-12-27 17:27:56,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:56,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:27:56,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440838577] [2019-12-27 17:27:56,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:56,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:57,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 17:27:57,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:57,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:27:57,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 17:27:57,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:27:57,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:27:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:27:57,272 INFO L87 Difference]: Start difference. First operand 22257 states and 68986 transitions. Second operand 8 states. [2019-12-27 17:27:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:27:58,328 INFO L93 Difference]: Finished difference Result 66585 states and 210599 transitions. [2019-12-27 17:27:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:27:58,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:27:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:27:58,607 INFO L225 Difference]: With dead ends: 66585 [2019-12-27 17:27:58,607 INFO L226 Difference]: Without dead ends: 44181 [2019-12-27 17:27:58,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:27:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44181 states. [2019-12-27 17:27:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44181 to 24729. [2019-12-27 17:27:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24729 states. [2019-12-27 17:27:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24729 states to 24729 states and 78388 transitions. [2019-12-27 17:27:59,118 INFO L78 Accepts]: Start accepts. Automaton has 24729 states and 78388 transitions. Word has length 64 [2019-12-27 17:27:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:27:59,118 INFO L462 AbstractCegarLoop]: Abstraction has 24729 states and 78388 transitions. [2019-12-27 17:27:59,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:27:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 24729 states and 78388 transitions. [2019-12-27 17:27:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:27:59,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:27:59,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:27:59,154 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 17:27:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:27:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1236003369, now seen corresponding path program 2 times [2019-12-27 17:27:59,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:27:59,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946287778] [2019-12-27 17:27:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:27:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:27:59,255 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 17:27:59,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946287778] [2019-12-27 17:27:59,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:27:59,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:27:59,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [21968115] [2019-12-27 17:27:59,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:27:59,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:27:59,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 417 transitions. [2019-12-27 17:27:59,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:27:59,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:27:59,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:27:59,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:27:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:27:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:27:59,592 INFO L87 Difference]: Start difference. First operand 24729 states and 78388 transitions. Second operand 11 states. [2019-12-27 17:28:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:00,483 INFO L93 Difference]: Finished difference Result 68349 states and 212105 transitions. [2019-12-27 17:28:00,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:28:00,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:28:00,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:00,556 INFO L225 Difference]: With dead ends: 68349 [2019-12-27 17:28:00,556 INFO L226 Difference]: Without dead ends: 47197 [2019-12-27 17:28:00,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:28:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47197 states. [2019-12-27 17:28:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47197 to 27916. [2019-12-27 17:28:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27916 states. [2019-12-27 17:28:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27916 states to 27916 states and 88171 transitions. [2019-12-27 17:28:01,362 INFO L78 Accepts]: Start accepts. Automaton has 27916 states and 88171 transitions. Word has length 64 [2019-12-27 17:28:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:01,362 INFO L462 AbstractCegarLoop]: Abstraction has 27916 states and 88171 transitions. [2019-12-27 17:28:01,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:28:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 27916 states and 88171 transitions. [2019-12-27 17:28:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:28:01,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:01,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:01,393 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 17:28:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-27 17:28:01,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:01,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991557950] [2019-12-27 17:28:01,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:01,488 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 17:28:01,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991557950] [2019-12-27 17:28:01,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:01,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1092142861] [2019-12-27 17:28:01,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:01,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:01,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 467 transitions. [2019-12-27 17:28:01,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:01,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:28:01,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:28:01,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:28:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:28:01,812 INFO L87 Difference]: Start difference. First operand 27916 states and 88171 transitions. Second operand 10 states. [2019-12-27 17:28:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:03,718 INFO L93 Difference]: Finished difference Result 138092 states and 423714 transitions. [2019-12-27 17:28:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 17:28:03,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:28:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:03,879 INFO L225 Difference]: With dead ends: 138092 [2019-12-27 17:28:03,879 INFO L226 Difference]: Without dead ends: 106798 [2019-12-27 17:28:03,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:28:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106798 states. [2019-12-27 17:28:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106798 to 32629. [2019-12-27 17:28:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32629 states. [2019-12-27 17:28:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32629 states to 32629 states and 103264 transitions. [2019-12-27 17:28:04,887 INFO L78 Accepts]: Start accepts. Automaton has 32629 states and 103264 transitions. Word has length 64 [2019-12-27 17:28:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:04,887 INFO L462 AbstractCegarLoop]: Abstraction has 32629 states and 103264 transitions. [2019-12-27 17:28:04,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:28:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 32629 states and 103264 transitions. [2019-12-27 17:28:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:28:04,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:04,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:04,924 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 17:28:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 4 times [2019-12-27 17:28:04,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:04,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842516016] [2019-12-27 17:28:04,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:05,013 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 17:28:05,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842516016] [2019-12-27 17:28:05,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:05,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:05,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1228518716] [2019-12-27 17:28:05,014 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:05,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:05,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 444 transitions. [2019-12-27 17:28:05,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:05,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:28:05,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:28:05,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:28:05,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:28:05,336 INFO L87 Difference]: Start difference. First operand 32629 states and 103264 transitions. Second operand 11 states. [2019-12-27 17:28:05,794 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 17:28:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:07,617 INFO L93 Difference]: Finished difference Result 91623 states and 283997 transitions. [2019-12-27 17:28:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:28:07,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:28:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:07,744 INFO L225 Difference]: With dead ends: 91623 [2019-12-27 17:28:07,744 INFO L226 Difference]: Without dead ends: 79667 [2019-12-27 17:28:07,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:28:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79667 states. [2019-12-27 17:28:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79667 to 33126. [2019-12-27 17:28:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33126 states. [2019-12-27 17:28:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33126 states to 33126 states and 104895 transitions. [2019-12-27 17:28:08,700 INFO L78 Accepts]: Start accepts. Automaton has 33126 states and 104895 transitions. Word has length 64 [2019-12-27 17:28:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:08,700 INFO L462 AbstractCegarLoop]: Abstraction has 33126 states and 104895 transitions. [2019-12-27 17:28:08,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:28:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 33126 states and 104895 transitions. [2019-12-27 17:28:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:28:08,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:08,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:08,737 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 17:28:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1357359899, now seen corresponding path program 5 times [2019-12-27 17:28:08,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:08,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893077598] [2019-12-27 17:28:08,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:08,813 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 17:28:08,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893077598] [2019-12-27 17:28:08,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:08,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:08,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545176069] [2019-12-27 17:28:08,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:08,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:09,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 354 transitions. [2019-12-27 17:28:09,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:09,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:28:09,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:09,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:09,268 INFO L87 Difference]: Start difference. First operand 33126 states and 104895 transitions. Second operand 3 states. [2019-12-27 17:28:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:09,491 INFO L93 Difference]: Finished difference Result 39471 states and 123843 transitions. [2019-12-27 17:28:09,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:09,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:28:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:09,598 INFO L225 Difference]: With dead ends: 39471 [2019-12-27 17:28:09,599 INFO L226 Difference]: Without dead ends: 39471 [2019-12-27 17:28:09,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39471 states. [2019-12-27 17:28:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39471 to 30148. [2019-12-27 17:28:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30148 states. [2019-12-27 17:28:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30148 states to 30148 states and 93705 transitions. [2019-12-27 17:28:10,706 INFO L78 Accepts]: Start accepts. Automaton has 30148 states and 93705 transitions. Word has length 64 [2019-12-27 17:28:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:10,707 INFO L462 AbstractCegarLoop]: Abstraction has 30148 states and 93705 transitions. [2019-12-27 17:28:10,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 30148 states and 93705 transitions. [2019-12-27 17:28:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:28:10,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:10,762 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 17:28:10,762 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 17:28:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-27 17:28:10,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:10,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173380822] [2019-12-27 17:28:10,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:10,829 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 17:28:10,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173380822] [2019-12-27 17:28:10,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:10,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:28:10,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [111469536] [2019-12-27 17:28:10,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:10,852 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:11,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 298 states and 592 transitions. [2019-12-27 17:28:11,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:11,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:28:11,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:28:11,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:28:11,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:11,185 INFO L87 Difference]: Start difference. First operand 30148 states and 93705 transitions. Second operand 4 states. [2019-12-27 17:28:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:11,530 INFO L93 Difference]: Finished difference Result 46425 states and 144908 transitions. [2019-12-27 17:28:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:11,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 17:28:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:11,830 INFO L225 Difference]: With dead ends: 46425 [2019-12-27 17:28:11,830 INFO L226 Difference]: Without dead ends: 46425 [2019-12-27 17:28:11,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 3 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 17:28:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46425 states. [2019-12-27 17:28:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46425 to 32186. [2019-12-27 17:28:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32186 states. [2019-12-27 17:28:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32186 states to 32186 states and 101141 transitions. [2019-12-27 17:28:12,465 INFO L78 Accepts]: Start accepts. Automaton has 32186 states and 101141 transitions. Word has length 65 [2019-12-27 17:28:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:12,465 INFO L462 AbstractCegarLoop]: Abstraction has 32186 states and 101141 transitions. [2019-12-27 17:28:12,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:28:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 32186 states and 101141 transitions. [2019-12-27 17:28:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:28:12,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:12,504 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 17:28:12,505 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 17:28:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-27 17:28:12,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:12,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463268545] [2019-12-27 17:28:12,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:12,599 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 17:28:12,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463268545] [2019-12-27 17:28:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:12,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:12,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569368907] [2019-12-27 17:28:12,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:12,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:12,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 470 transitions. [2019-12-27 17:28:12,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:13,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 17:28:13,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:28:13,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:13,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:28:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:28:13,161 INFO L87 Difference]: Start difference. First operand 32186 states and 101141 transitions. Second operand 12 states. [2019-12-27 17:28:15,500 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-27 17:28:16,216 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-27 17:28:17,504 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 17:28:17,812 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 17:28:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:19,029 INFO L93 Difference]: Finished difference Result 176168 states and 542950 transitions. [2019-12-27 17:28:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 17:28:19,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 17:28:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:19,259 INFO L225 Difference]: With dead ends: 176168 [2019-12-27 17:28:19,260 INFO L226 Difference]: Without dead ends: 134867 [2019-12-27 17:28:19,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=583, Invalid=2173, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 17:28:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134867 states. [2019-12-27 17:28:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134867 to 36605. [2019-12-27 17:28:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36605 states. [2019-12-27 17:28:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36605 states to 36605 states and 116125 transitions. [2019-12-27 17:28:21,235 INFO L78 Accepts]: Start accepts. Automaton has 36605 states and 116125 transitions. Word has length 65 [2019-12-27 17:28:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:21,235 INFO L462 AbstractCegarLoop]: Abstraction has 36605 states and 116125 transitions. [2019-12-27 17:28:21,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:28:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 36605 states and 116125 transitions. [2019-12-27 17:28:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:28:21,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:21,281 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 17:28:21,282 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 17:28:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 1 times [2019-12-27 17:28:21,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:21,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648647090] [2019-12-27 17:28:21,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:21,356 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 17:28:21,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648647090] [2019-12-27 17:28:21,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:21,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:21,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1036871228] [2019-12-27 17:28:21,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:21,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:21,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 332 transitions. [2019-12-27 17:28:21,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:21,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:28:21,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:28:21,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:28:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:28:21,707 INFO L87 Difference]: Start difference. First operand 36605 states and 116125 transitions. Second operand 8 states. [2019-12-27 17:28:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:23,093 INFO L93 Difference]: Finished difference Result 74018 states and 233023 transitions. [2019-12-27 17:28:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:28:23,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 17:28:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:23,213 INFO L225 Difference]: With dead ends: 74018 [2019-12-27 17:28:23,213 INFO L226 Difference]: Without dead ends: 74018 [2019-12-27 17:28:23,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:28:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74018 states. [2019-12-27 17:28:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74018 to 38003. [2019-12-27 17:28:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38003 states. [2019-12-27 17:28:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38003 states to 38003 states and 120333 transitions. [2019-12-27 17:28:24,623 INFO L78 Accepts]: Start accepts. Automaton has 38003 states and 120333 transitions. Word has length 65 [2019-12-27 17:28:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:24,623 INFO L462 AbstractCegarLoop]: Abstraction has 38003 states and 120333 transitions. [2019-12-27 17:28:24,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:28:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 38003 states and 120333 transitions. [2019-12-27 17:28:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:28:24,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:24,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:24,672 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 17:28:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-27 17:28:24,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:24,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578790205] [2019-12-27 17:28:24,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:24,741 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 17:28:24,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578790205] [2019-12-27 17:28:24,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:24,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:28:24,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1094563712] [2019-12-27 17:28:24,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:24,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:24,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 273 transitions. [2019-12-27 17:28:24,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:24,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:28:24,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:24,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:24,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:24,954 INFO L87 Difference]: Start difference. First operand 38003 states and 120333 transitions. Second operand 5 states. [2019-12-27 17:28:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:25,584 INFO L93 Difference]: Finished difference Result 56046 states and 173158 transitions. [2019-12-27 17:28:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:28:25,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 17:28:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:25,679 INFO L225 Difference]: With dead ends: 56046 [2019-12-27 17:28:25,679 INFO L226 Difference]: Without dead ends: 55826 [2019-12-27 17:28:25,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:28:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55826 states. [2019-12-27 17:28:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55826 to 44239. [2019-12-27 17:28:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44239 states. [2019-12-27 17:28:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44239 states to 44239 states and 139698 transitions. [2019-12-27 17:28:26,492 INFO L78 Accepts]: Start accepts. Automaton has 44239 states and 139698 transitions. Word has length 65 [2019-12-27 17:28:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:26,492 INFO L462 AbstractCegarLoop]: Abstraction has 44239 states and 139698 transitions. [2019-12-27 17:28:26,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 44239 states and 139698 transitions. [2019-12-27 17:28:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:28:26,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:26,546 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 17:28:26,546 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 17:28:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-27 17:28:26,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:26,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071685900] [2019-12-27 17:28:26,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:26,613 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 17:28:26,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071685900] [2019-12-27 17:28:26,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:26,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:26,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411742471] [2019-12-27 17:28:26,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:26,633 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:27,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 304 transitions. [2019-12-27 17:28:27,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:27,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:27,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:27,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:27,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:27,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:27,040 INFO L87 Difference]: Start difference. First operand 44239 states and 139698 transitions. Second operand 3 states. [2019-12-27 17:28:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:27,192 INFO L93 Difference]: Finished difference Result 44239 states and 139697 transitions. [2019-12-27 17:28:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:27,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:28:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:27,260 INFO L225 Difference]: With dead ends: 44239 [2019-12-27 17:28:27,261 INFO L226 Difference]: Without dead ends: 44239 [2019-12-27 17:28:27,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44239 states. [2019-12-27 17:28:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44239 to 38666. [2019-12-27 17:28:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38666 states. [2019-12-27 17:28:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38666 states to 38666 states and 124013 transitions. [2019-12-27 17:28:27,982 INFO L78 Accepts]: Start accepts. Automaton has 38666 states and 124013 transitions. Word has length 65 [2019-12-27 17:28:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:27,983 INFO L462 AbstractCegarLoop]: Abstraction has 38666 states and 124013 transitions. [2019-12-27 17:28:27,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 38666 states and 124013 transitions. [2019-12-27 17:28:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:28:28,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:28,033 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 17:28:28,033 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 17:28:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-27 17:28:28,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:28,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486439056] [2019-12-27 17:28:28,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:28,292 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 17:28:28,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486439056] [2019-12-27 17:28:28,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:28,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:28:28,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1669068196] [2019-12-27 17:28:28,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:28,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:28,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 274 transitions. [2019-12-27 17:28:28,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:28,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:28:28,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:28:28,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:28:28,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:28:28,767 INFO L87 Difference]: Start difference. First operand 38666 states and 124013 transitions. Second operand 16 states. [2019-12-27 17:28:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:33,616 INFO L93 Difference]: Finished difference Result 72171 states and 224183 transitions. [2019-12-27 17:28:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 17:28:33,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 17:28:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:33,729 INFO L225 Difference]: With dead ends: 72171 [2019-12-27 17:28:33,730 INFO L226 Difference]: Without dead ends: 72045 [2019-12-27 17:28:33,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:28:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72045 states. [2019-12-27 17:28:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72045 to 41484. [2019-12-27 17:28:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41484 states. [2019-12-27 17:28:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41484 states to 41484 states and 132745 transitions. [2019-12-27 17:28:34,720 INFO L78 Accepts]: Start accepts. Automaton has 41484 states and 132745 transitions. Word has length 66 [2019-12-27 17:28:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:34,721 INFO L462 AbstractCegarLoop]: Abstraction has 41484 states and 132745 transitions. [2019-12-27 17:28:34,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:28:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41484 states and 132745 transitions. [2019-12-27 17:28:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:28:34,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:34,768 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 17:28:34,768 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 17:28:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-27 17:28:34,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:34,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201326854] [2019-12-27 17:28:34,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:34,837 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 17:28:34,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201326854] [2019-12-27 17:28:34,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:34,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:34,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438923474] [2019-12-27 17:28:34,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:34,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:35,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 266 transitions. [2019-12-27 17:28:35,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:35,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:28:35,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:35,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:35,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:35,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:35,052 INFO L87 Difference]: Start difference. First operand 41484 states and 132745 transitions. Second operand 3 states. [2019-12-27 17:28:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:35,255 INFO L93 Difference]: Finished difference Result 34581 states and 108120 transitions. [2019-12-27 17:28:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:35,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:28:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:35,332 INFO L225 Difference]: With dead ends: 34581 [2019-12-27 17:28:35,332 INFO L226 Difference]: Without dead ends: 34581 [2019-12-27 17:28:35,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34581 states. [2019-12-27 17:28:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34581 to 32907. [2019-12-27 17:28:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32907 states. [2019-12-27 17:28:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32907 states to 32907 states and 102730 transitions. [2019-12-27 17:28:36,213 INFO L78 Accepts]: Start accepts. Automaton has 32907 states and 102730 transitions. Word has length 66 [2019-12-27 17:28:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:36,213 INFO L462 AbstractCegarLoop]: Abstraction has 32907 states and 102730 transitions. [2019-12-27 17:28:36,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32907 states and 102730 transitions. [2019-12-27 17:28:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:28:36,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:36,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:36,255 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 17:28:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2087745019, now seen corresponding path program 1 times [2019-12-27 17:28:36,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:36,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781470835] [2019-12-27 17:28:36,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:36,324 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 17:28:36,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781470835] [2019-12-27 17:28:36,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:36,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:36,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538351594] [2019-12-27 17:28:36,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:36,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:36,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 315 states and 643 transitions. [2019-12-27 17:28:36,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:36,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:28:36,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:28:36,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:36,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:28:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:36,756 INFO L87 Difference]: Start difference. First operand 32907 states and 102730 transitions. Second operand 4 states. [2019-12-27 17:28:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:37,000 INFO L93 Difference]: Finished difference Result 32907 states and 102496 transitions. [2019-12-27 17:28:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:37,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 17:28:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:37,069 INFO L225 Difference]: With dead ends: 32907 [2019-12-27 17:28:37,069 INFO L226 Difference]: Without dead ends: 32907 [2019-12-27 17:28:37,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 4 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 17:28:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32907 states. [2019-12-27 17:28:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32907 to 28328. [2019-12-27 17:28:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28328 states. [2019-12-27 17:28:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28328 states to 28328 states and 88334 transitions. [2019-12-27 17:28:37,616 INFO L78 Accepts]: Start accepts. Automaton has 28328 states and 88334 transitions. Word has length 67 [2019-12-27 17:28:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:37,617 INFO L462 AbstractCegarLoop]: Abstraction has 28328 states and 88334 transitions. [2019-12-27 17:28:37,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:28:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28328 states and 88334 transitions. [2019-12-27 17:28:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:28:37,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:37,647 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 17:28:37,647 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 17:28:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-27 17:28:37,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:37,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386978034] [2019-12-27 17:28:37,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:38,105 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 17:28:38,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386978034] [2019-12-27 17:28:38,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:38,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 17:28:38,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868365955] [2019-12-27 17:28:38,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:38,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:38,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 17:28:38,684 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:39,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:39,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:39,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:39,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:40,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:28:40,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 17:28:40,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 17:28:40,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 17:28:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:28:40,333 INFO L87 Difference]: Start difference. First operand 28328 states and 88334 transitions. Second operand 32 states. [2019-12-27 17:28:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:54,401 INFO L93 Difference]: Finished difference Result 56228 states and 171875 transitions. [2019-12-27 17:28:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-12-27 17:28:54,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2019-12-27 17:28:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:54,482 INFO L225 Difference]: With dead ends: 56228 [2019-12-27 17:28:54,482 INFO L226 Difference]: Without dead ends: 49657 [2019-12-27 17:28:54,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4149 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1872, Invalid=11468, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 17:28:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49657 states. [2019-12-27 17:28:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49657 to 29401. [2019-12-27 17:28:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29401 states. [2019-12-27 17:28:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29401 states to 29401 states and 91244 transitions. [2019-12-27 17:28:55,098 INFO L78 Accepts]: Start accepts. Automaton has 29401 states and 91244 transitions. Word has length 67 [2019-12-27 17:28:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:55,099 INFO L462 AbstractCegarLoop]: Abstraction has 29401 states and 91244 transitions. [2019-12-27 17:28:55,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 17:28:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29401 states and 91244 transitions. [2019-12-27 17:28:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:28:55,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:55,133 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 17:28:55,133 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 17:28:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 2 times [2019-12-27 17:28:55,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:55,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294920841] [2019-12-27 17:28:55,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:55,577 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 17:28:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294920841] [2019-12-27 17:28:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:55,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 17:28:55,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305419123] [2019-12-27 17:28:55,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:55,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:56,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 344 states and 711 transitions. [2019-12-27 17:28:56,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:56,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:57,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:57,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:28:57,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:28:57,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 17:28:57,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 17:28:57,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 17:28:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:28:57,784 INFO L87 Difference]: Start difference. First operand 29401 states and 91244 transitions. Second operand 32 states. [2019-12-27 17:29:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:14,586 INFO L93 Difference]: Finished difference Result 72391 states and 221306 transitions. [2019-12-27 17:29:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 17:29:14,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2019-12-27 17:29:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:14,682 INFO L225 Difference]: With dead ends: 72391 [2019-12-27 17:29:14,682 INFO L226 Difference]: Without dead ends: 58427 [2019-12-27 17:29:14,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 11 SyntacticMatches, 19 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1086, Invalid=6746, Unknown=0, NotChecked=0, Total=7832 [2019-12-27 17:29:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58427 states. [2019-12-27 17:29:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58427 to 31858. [2019-12-27 17:29:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31858 states. [2019-12-27 17:29:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31858 states to 31858 states and 98361 transitions. [2019-12-27 17:29:15,616 INFO L78 Accepts]: Start accepts. Automaton has 31858 states and 98361 transitions. Word has length 67 [2019-12-27 17:29:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:15,616 INFO L462 AbstractCegarLoop]: Abstraction has 31858 states and 98361 transitions. [2019-12-27 17:29:15,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 17:29:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 31858 states and 98361 transitions. [2019-12-27 17:29:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:29:15,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:15,654 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 17:29:15,654 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 17:29:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1363751709, now seen corresponding path program 3 times [2019-12-27 17:29:15,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:15,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608834114] [2019-12-27 17:29:15,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:16,036 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 17:29:16,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608834114] [2019-12-27 17:29:16,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:16,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:29:16,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377048496] [2019-12-27 17:29:16,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:16,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:16,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 386 states and 816 transitions. [2019-12-27 17:29:16,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:17,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:29:18,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:29:18,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 54 times. [2019-12-27 17:29:18,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 17:29:18,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:18,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 17:29:18,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:29:18,855 INFO L87 Difference]: Start difference. First operand 31858 states and 98361 transitions. Second operand 34 states. [2019-12-27 17:29:23,323 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-27 17:29:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:48,803 INFO L93 Difference]: Finished difference Result 96012 states and 290035 transitions. [2019-12-27 17:29:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-27 17:29:48,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 17:29:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:48,940 INFO L225 Difference]: With dead ends: 96012 [2019-12-27 17:29:48,940 INFO L226 Difference]: Without dead ends: 87975 [2019-12-27 17:29:48,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 18 SyntacticMatches, 19 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12279 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=4354, Invalid=30802, Unknown=0, NotChecked=0, Total=35156 [2019-12-27 17:29:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87975 states. [2019-12-27 17:29:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87975 to 37725. [2019-12-27 17:29:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37725 states. [2019-12-27 17:29:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37725 states to 37725 states and 116879 transitions. [2019-12-27 17:29:50,237 INFO L78 Accepts]: Start accepts. Automaton has 37725 states and 116879 transitions. Word has length 67 [2019-12-27 17:29:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:50,238 INFO L462 AbstractCegarLoop]: Abstraction has 37725 states and 116879 transitions. [2019-12-27 17:29:50,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 17:29:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37725 states and 116879 transitions. [2019-12-27 17:29:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:29:50,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:50,282 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 17:29:50,282 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 17:29:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:50,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 4 times [2019-12-27 17:29:50,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:50,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372425835] [2019-12-27 17:29:50,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:50,742 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 17:29:50,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372425835] [2019-12-27 17:29:50,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:50,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 17:29:50,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523280930] [2019-12-27 17:29:50,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:50,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:51,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 352 states and 737 transitions. [2019-12-27 17:29:51,033 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:51,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:51,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:51,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:52,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:29:52,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:29:52,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 49 times. [2019-12-27 17:29:52,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 17:29:52,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 17:29:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 17:29:52,627 INFO L87 Difference]: Start difference. First operand 37725 states and 116879 transitions. Second operand 33 states. [2019-12-27 17:30:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:30:05,581 INFO L93 Difference]: Finished difference Result 69764 states and 211279 transitions. [2019-12-27 17:30:05,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 17:30:05,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-12-27 17:30:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:30:05,683 INFO L225 Difference]: With dead ends: 69764 [2019-12-27 17:30:05,683 INFO L226 Difference]: Without dead ends: 63859 [2019-12-27 17:30:05,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 14 SyntacticMatches, 24 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1275, Invalid=7097, Unknown=0, NotChecked=0, Total=8372 [2019-12-27 17:30:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63859 states. [2019-12-27 17:30:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63859 to 38083. [2019-12-27 17:30:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38083 states. [2019-12-27 17:30:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38083 states to 38083 states and 117866 transitions. [2019-12-27 17:30:06,508 INFO L78 Accepts]: Start accepts. Automaton has 38083 states and 117866 transitions. Word has length 67 [2019-12-27 17:30:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:30:06,508 INFO L462 AbstractCegarLoop]: Abstraction has 38083 states and 117866 transitions. [2019-12-27 17:30:06,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 17:30:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 38083 states and 117866 transitions. [2019-12-27 17:30:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:30:06,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:30:06,555 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 17:30:06,555 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:30:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:30:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 5 times [2019-12-27 17:30:06,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:30:06,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136257500] [2019-12-27 17:30:06,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:30:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:30:06,930 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 17:30:06,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136257500] [2019-12-27 17:30:06,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:30:06,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 17:30:06,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656983882] [2019-12-27 17:30:06,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:30:06,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:30:07,275 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 394 states and 842 transitions. [2019-12-27 17:30:07,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:30:07,700 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-27 17:30:08,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:30:08,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:30:08,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:30:08,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:30:09,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:30:09,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:30:09,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 59 times. [2019-12-27 17:30:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 17:30:09,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:30:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 17:30:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 17:30:09,501 INFO L87 Difference]: Start difference. First operand 38083 states and 117866 transitions. Second operand 35 states. Received shutdown request... [2019-12-27 17:30:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-12-27 17:30:31,667 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:30:31,670 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:30:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:30:31 BasicIcfg [2019-12-27 17:30:31,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:30:31,672 INFO L168 Benchmark]: Toolchain (without parser) took 225577.86 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 17:30:31,673 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:30:31,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.88 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 157.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:30:31,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:30:31,678 INFO L168 Benchmark]: Boogie Preprocessor took 57.78 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 152.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:30:31,679 INFO L168 Benchmark]: RCFGBuilder took 841.03 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 102.5 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:30:31,679 INFO L168 Benchmark]: TraceAbstraction took 223805.02 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:30:31,685 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.88 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 157.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.78 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 152.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.03 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 102.5 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223805.02 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 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 (38083states) and FLOYD_HOARE automaton (currently 121 states, 35 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 145 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (38083states) and FLOYD_HOARE automaton (currently 121 states, 35 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 145 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: TIMEOUT, OverallTime: 223.6s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 133.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7637 SDtfs, 18576 SDslu, 38539 SDs, 0 SdLazy, 60845 SolverSat, 1745 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1330 GetRequests, 272 SyntacticMatches, 175 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29692 ImplicationChecksByTransitivity, 40.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 41.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 555067 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1471 NumberOfCodeBlocks, 1471 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1442 ConstructedInterpolants, 0 QuantifiedInterpolants, 346966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown