/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:41:58,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:41:58,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:41:58,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:41:58,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:41:58,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:41:58,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:41:58,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:41:58,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:41:58,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:41:58,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:41:58,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:41:58,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:41:58,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:41:58,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:41:58,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:41:58,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:41:58,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:41:58,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:41:58,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:41:58,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:41:58,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:41:58,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:41:58,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:41:58,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:41:58,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:41:58,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:41:58,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:41:58,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:41:58,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:41:58,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:41:58,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:41:58,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:41:58,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:41:58,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:41:58,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:41:58,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:41:58,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:41:58,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:41:58,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:41:58,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:41:58,721 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.epf [2019-12-27 03:41:58,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:41:58,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:41:58,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:41:58,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:41:58,743 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:41:58,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:41:58,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:41:58,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:41:58,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:41:58,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:41:58,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:41:58,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:41:58,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:41:58,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:41:58,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:41:58,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:41:58,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:41:58,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:41:58,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:41:58,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:41:58,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:41:58,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:41:58,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:41:58,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:41:58,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:41:58,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:41:58,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:41:58,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:41:58,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:41:59,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:41:59,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:41:59,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:41:59,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:41:59,053 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:41:59,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i [2019-12-27 03:41:59,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae790536/94f0b688e35145e09b052b0eef2731aa/FLAGa864747eb [2019-12-27 03:41:59,649 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:41:59,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i [2019-12-27 03:41:59,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae790536/94f0b688e35145e09b052b0eef2731aa/FLAGa864747eb [2019-12-27 03:41:59,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae790536/94f0b688e35145e09b052b0eef2731aa [2019-12-27 03:41:59,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:41:59,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:41:59,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:41:59,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:41:59,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:41:59,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:41:59" (1/1) ... [2019-12-27 03:41:59,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:41:59, skipping insertion in model container [2019-12-27 03:41:59,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:41:59" (1/1) ... [2019-12-27 03:41:59,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:42:00,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:42:00,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:42:00,653 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:42:00,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:42:00,842 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:42:00,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00 WrapperNode [2019-12-27 03:42:00,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:42:00,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:42:00,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:42:00,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:42:00,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:42:00,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:42:00,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:42:00,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:42:00,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (1/1) ... [2019-12-27 03:42:00,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:42:00,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:42:00,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:42:00,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:42:00,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (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 03:42:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:42:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:42:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:42:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:42:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:42:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:42:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:42:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:42:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:42:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:42:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:42:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:42:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:42:01,054 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 03:42:01,809 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:42:01,809 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:42:01,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:42:01 BoogieIcfgContainer [2019-12-27 03:42:01,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:42:01,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:42:01,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:42:01,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:42:01,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:41:59" (1/3) ... [2019-12-27 03:42:01,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:42:01, skipping insertion in model container [2019-12-27 03:42:01,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:42:00" (2/3) ... [2019-12-27 03:42:01,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:42:01, skipping insertion in model container [2019-12-27 03:42:01,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:42:01" (3/3) ... [2019-12-27 03:42:01,819 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.opt.i [2019-12-27 03:42:01,829 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:42:01,829 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:42:01,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:42:01,837 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:42:01,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,903 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,912 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,912 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,943 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,948 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:42:01,967 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:42:01,986 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:42:01,987 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:42:01,987 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:42:01,987 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:42:01,987 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:42:01,987 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:42:01,987 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:42:01,987 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:42:02,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 03:42:02,003 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:42:02,099 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:42:02,099 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:42:02,118 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:42:02,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 03:42:02,235 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 03:42:02,236 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:42:02,246 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:42:02,269 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:42:02,270 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:42:07,574 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 03:42:07,907 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 03:42:08,026 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 03:42:08,127 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-27 03:42:08,127 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 03:42:08,133 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 03:42:19,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 03:42:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 03:42:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:42:19,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:19,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:42:19,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-27 03:42:19,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:19,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602918843] [2019-12-27 03:42:19,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:19,769 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 03:42:19,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602918843] [2019-12-27 03:42:19,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:19,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:42:19,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140935972] [2019-12-27 03:42:19,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:19,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:19,796 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 03:42:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:20,868 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 03:42:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:20,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:42:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:21,548 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 03:42:21,548 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 03:42:21,550 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 03:42:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 03:42:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 03:42:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 03:42:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 03:42:32,027 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 03:42:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:32,027 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 03:42:32,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 03:42:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:42:32,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:32,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:32,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-27 03:42:32,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:32,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634271813] [2019-12-27 03:42:32,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:32,172 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 03:42:32,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634271813] [2019-12-27 03:42:32,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:32,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:32,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815658728] [2019-12-27 03:42:32,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:32,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:32,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:32,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:32,176 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 03:42:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:36,828 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 03:42:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:42:36,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:42:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:37,345 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 03:42:37,345 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 03:42:37,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 03:42:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 03:42:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 03:42:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 03:42:43,636 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 03:42:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:43,637 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 03:42:43,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 03:42:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:42:43,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:43,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:43,640 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-27 03:42:43,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:43,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637041258] [2019-12-27 03:42:43,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:43,795 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 03:42:43,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637041258] [2019-12-27 03:42:43,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:43,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:43,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853285353] [2019-12-27 03:42:43,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:43,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:43,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:43,797 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 03:42:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:49,411 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 03:42:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:42:49,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:42:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:49,885 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 03:42:49,885 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 03:42:49,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 03:42:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 03:42:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 03:42:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 03:42:57,282 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 03:42:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:57,282 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 03:42:57,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 03:42:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:42:57,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:57,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:57,286 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-27 03:42:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:57,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345448642] [2019-12-27 03:42:57,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:57,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345448642] [2019-12-27 03:42:57,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:57,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:57,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457276325] [2019-12-27 03:42:57,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:57,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:57,344 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-27 03:43:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:43:03,692 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 03:43:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:43:03,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 03:43:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:43:04,259 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 03:43:04,260 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 03:43:04,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:43:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 03:43:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 03:43:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 03:43:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 03:43:12,772 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 03:43:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:43:12,772 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 03:43:12,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:43:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 03:43:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:43:12,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:43:12,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:43:12,776 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:43:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:43:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-27 03:43:12,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:43:12,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854112174] [2019-12-27 03:43:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:43:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:43:12,857 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 03:43:12,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854112174] [2019-12-27 03:43:12,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:43:12,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:43:12,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560679287] [2019-12-27 03:43:12,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:43:12,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:43:12,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:43:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:43:12,859 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-27 03:43:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:43:15,238 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 03:43:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:43:15,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:43:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:43:15,779 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 03:43:15,780 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 03:43:15,780 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 03:43:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 03:43:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 03:43:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 03:43:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 03:43:29,501 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 03:43:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:43:29,501 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 03:43:29,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:43:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 03:43:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:43:29,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:43:29,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:43:29,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:43:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:43:29,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-27 03:43:29,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:43:29,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905154506] [2019-12-27 03:43:29,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:43:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:43:29,572 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 03:43:29,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905154506] [2019-12-27 03:43:29,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:43:29,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:43:29,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145205569] [2019-12-27 03:43:29,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:43:29,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:43:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:43:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:43:29,575 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-27 03:43:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:43:31,722 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 03:43:31,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:43:31,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:43:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:43:39,217 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 03:43:39,217 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 03:43:39,218 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 03:43:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 03:43:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 03:43:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 03:43:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 03:43:46,898 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 03:43:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:43:46,899 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 03:43:46,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:43:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 03:43:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:43:46,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:43:46,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:43:46,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:43:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:43:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-27 03:43:46,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:43:46,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784933489] [2019-12-27 03:43:46,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:43:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:43:46,987 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 03:43:46,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784933489] [2019-12-27 03:43:46,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:43:46,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:43:46,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503399894] [2019-12-27 03:43:46,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:43:46,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:43:46,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:43:46,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:43:46,989 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 03:43:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:43:52,741 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 03:43:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:43:52,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 03:43:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:43:53,231 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 03:43:53,232 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 03:43:53,232 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 03:43:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 03:44:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 03:44:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 03:44:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 03:44:01,754 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 03:44:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:44:01,755 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 03:44:01,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:44:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 03:44:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:44:01,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:44:01,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:44:01,776 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:44:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:44:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-27 03:44:01,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:44:01,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607493268] [2019-12-27 03:44:01,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:44:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:44:01,827 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 03:44:01,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607493268] [2019-12-27 03:44:01,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:44:01,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:44:01,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017509705] [2019-12-27 03:44:01,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:44:01,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:44:01,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:44:01,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:44:01,829 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-27 03:44:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:44:09,581 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-27 03:44:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:44:09,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:44:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:44:09,992 INFO L225 Difference]: With dead ends: 255238 [2019-12-27 03:44:09,992 INFO L226 Difference]: Without dead ends: 128270 [2019-12-27 03:44:09,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 03:44:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-27 03:44:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-27 03:44:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-27 03:44:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-27 03:44:16,681 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-27 03:44:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:44:16,682 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-27 03:44:16,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:44:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-27 03:44:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:44:16,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:44:16,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:44:16,698 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:44:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:44:16,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-27 03:44:16,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:44:16,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041179502] [2019-12-27 03:44:16,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:44:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:44:16,847 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 03:44:16,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041179502] [2019-12-27 03:44:16,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:44:16,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:44:16,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269028810] [2019-12-27 03:44:16,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:44:16,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:44:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:44:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:44:16,850 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 5 states. [2019-12-27 03:44:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:44:23,253 INFO L93 Difference]: Finished difference Result 169569 states and 676181 transitions. [2019-12-27 03:44:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:44:23,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:44:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:44:23,755 INFO L225 Difference]: With dead ends: 169569 [2019-12-27 03:44:23,755 INFO L226 Difference]: Without dead ends: 167273 [2019-12-27 03:44:23,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:44:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167273 states. [2019-12-27 03:44:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167273 to 132643. [2019-12-27 03:44:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132643 states. [2019-12-27 03:44:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132643 states to 132643 states and 541600 transitions. [2019-12-27 03:44:30,953 INFO L78 Accepts]: Start accepts. Automaton has 132643 states and 541600 transitions. Word has length 19 [2019-12-27 03:44:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:44:30,953 INFO L462 AbstractCegarLoop]: Abstraction has 132643 states and 541600 transitions. [2019-12-27 03:44:30,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:44:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 132643 states and 541600 transitions. [2019-12-27 03:44:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 03:44:30,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:44:30,971 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] [2019-12-27 03:44:30,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:44:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:44:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1494619507, now seen corresponding path program 1 times [2019-12-27 03:44:30,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:44:30,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106237750] [2019-12-27 03:44:30,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:44:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:44:31,020 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 03:44:31,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106237750] [2019-12-27 03:44:31,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:44:31,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:44:31,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345780256] [2019-12-27 03:44:31,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:44:31,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:44:31,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:44:31,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:44:31,023 INFO L87 Difference]: Start difference. First operand 132643 states and 541600 transitions. Second operand 3 states. [2019-12-27 03:44:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:44:33,066 INFO L93 Difference]: Finished difference Result 225373 states and 923689 transitions. [2019-12-27 03:44:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:44:33,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 03:44:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:44:33,405 INFO L225 Difference]: With dead ends: 225373 [2019-12-27 03:44:33,405 INFO L226 Difference]: Without dead ends: 114993 [2019-12-27 03:44:33,405 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 03:44:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114993 states. [2019-12-27 03:44:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114993 to 105754. [2019-12-27 03:44:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105754 states. [2019-12-27 03:44:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105754 states to 105754 states and 434218 transitions. [2019-12-27 03:44:45,137 INFO L78 Accepts]: Start accepts. Automaton has 105754 states and 434218 transitions. Word has length 20 [2019-12-27 03:44:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:44:45,137 INFO L462 AbstractCegarLoop]: Abstraction has 105754 states and 434218 transitions. [2019-12-27 03:44:45,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:44:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 105754 states and 434218 transitions. [2019-12-27 03:44:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 03:44:45,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:44:45,155 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] [2019-12-27 03:44:45,155 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:44:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:44:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1548802701, now seen corresponding path program 1 times [2019-12-27 03:44:45,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:44:45,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64267308] [2019-12-27 03:44:45,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:44:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:44:45,225 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 03:44:45,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64267308] [2019-12-27 03:44:45,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:44:45,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:44:45,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974818411] [2019-12-27 03:44:45,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:44:45,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:44:45,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:44:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:44:45,227 INFO L87 Difference]: Start difference. First operand 105754 states and 434218 transitions. Second operand 3 states. [2019-12-27 03:44:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:44:45,727 INFO L93 Difference]: Finished difference Result 100628 states and 407277 transitions. [2019-12-27 03:44:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:44:45,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 03:44:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:44:46,029 INFO L225 Difference]: With dead ends: 100628 [2019-12-27 03:44:46,030 INFO L226 Difference]: Without dead ends: 100628 [2019-12-27 03:44:46,030 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 03:44:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100628 states. [2019-12-27 03:44:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100628 to 100628. [2019-12-27 03:44:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100628 states. [2019-12-27 03:44:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100628 states to 100628 states and 407277 transitions. [2019-12-27 03:44:58,744 INFO L78 Accepts]: Start accepts. Automaton has 100628 states and 407277 transitions. Word has length 21 [2019-12-27 03:44:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:44:58,744 INFO L462 AbstractCegarLoop]: Abstraction has 100628 states and 407277 transitions. [2019-12-27 03:44:58,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:44:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 100628 states and 407277 transitions. [2019-12-27 03:44:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:44:58,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:44:58,759 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 03:44:58,759 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:44:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:44:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-27 03:44:58,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:44:58,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149069109] [2019-12-27 03:44:58,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:44:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:44:58,828 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 03:44:58,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149069109] [2019-12-27 03:44:58,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:44:58,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:44:58,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583241239] [2019-12-27 03:44:58,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:44:58,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:44:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:44:58,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:44:58,832 INFO L87 Difference]: Start difference. First operand 100628 states and 407277 transitions. Second operand 5 states. [2019-12-27 03:44:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:44:59,752 INFO L93 Difference]: Finished difference Result 104069 states and 416887 transitions. [2019-12-27 03:44:59,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:44:59,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:44:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:00,030 INFO L225 Difference]: With dead ends: 104069 [2019-12-27 03:45:00,030 INFO L226 Difference]: Without dead ends: 102827 [2019-12-27 03:45:00,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:45:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102827 states. [2019-12-27 03:45:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102827 to 100822. [2019-12-27 03:45:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100822 states. [2019-12-27 03:45:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100822 states to 100822 states and 407649 transitions. [2019-12-27 03:45:05,663 INFO L78 Accepts]: Start accepts. Automaton has 100822 states and 407649 transitions. Word has length 22 [2019-12-27 03:45:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:05,663 INFO L462 AbstractCegarLoop]: Abstraction has 100822 states and 407649 transitions. [2019-12-27 03:45:05,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:45:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 100822 states and 407649 transitions. [2019-12-27 03:45:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:45:05,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:05,678 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 03:45:05,678 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1430161370, now seen corresponding path program 1 times [2019-12-27 03:45:05,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:05,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320443656] [2019-12-27 03:45:05,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:06,390 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 03:45:06,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320443656] [2019-12-27 03:45:06,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:06,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:45:06,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312071723] [2019-12-27 03:45:06,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:45:06,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:45:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:45:06,396 INFO L87 Difference]: Start difference. First operand 100822 states and 407649 transitions. Second operand 4 states. [2019-12-27 03:45:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:06,554 INFO L93 Difference]: Finished difference Result 24741 states and 85003 transitions. [2019-12-27 03:45:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:45:06,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 03:45:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:06,606 INFO L225 Difference]: With dead ends: 24741 [2019-12-27 03:45:06,606 INFO L226 Difference]: Without dead ends: 19654 [2019-12-27 03:45:06,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:45:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-12-27 03:45:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 19653. [2019-12-27 03:45:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19653 states. [2019-12-27 03:45:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19653 states to 19653 states and 64512 transitions. [2019-12-27 03:45:07,078 INFO L78 Accepts]: Start accepts. Automaton has 19653 states and 64512 transitions. Word has length 22 [2019-12-27 03:45:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:07,078 INFO L462 AbstractCegarLoop]: Abstraction has 19653 states and 64512 transitions. [2019-12-27 03:45:07,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:45:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 19653 states and 64512 transitions. [2019-12-27 03:45:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:45:07,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:07,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:45:07,082 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:07,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-27 03:45:07,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:07,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122636107] [2019-12-27 03:45:07,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:07,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 03:45:07,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122636107] [2019-12-27 03:45:07,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:07,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:45:07,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931150931] [2019-12-27 03:45:07,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:45:07,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:07,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:45:07,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:45:07,168 INFO L87 Difference]: Start difference. First operand 19653 states and 64512 transitions. Second operand 5 states. [2019-12-27 03:45:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:07,498 INFO L93 Difference]: Finished difference Result 19629 states and 63954 transitions. [2019-12-27 03:45:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:45:07,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:45:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:07,543 INFO L225 Difference]: With dead ends: 19629 [2019-12-27 03:45:07,543 INFO L226 Difference]: Without dead ends: 19190 [2019-12-27 03:45:07,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:45:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19190 states. [2019-12-27 03:45:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19190 to 18577. [2019-12-27 03:45:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18577 states. [2019-12-27 03:45:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18577 states to 18577 states and 61446 transitions. [2019-12-27 03:45:07,904 INFO L78 Accepts]: Start accepts. Automaton has 18577 states and 61446 transitions. Word has length 22 [2019-12-27 03:45:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:07,905 INFO L462 AbstractCegarLoop]: Abstraction has 18577 states and 61446 transitions. [2019-12-27 03:45:07,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:45:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 18577 states and 61446 transitions. [2019-12-27 03:45:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:45:07,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:07,912 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] [2019-12-27 03:45:07,912 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-27 03:45:07,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:07,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3756670] [2019-12-27 03:45:07,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:08,022 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 03:45:08,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3756670] [2019-12-27 03:45:08,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:08,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:45:08,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703225261] [2019-12-27 03:45:08,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:45:08,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:45:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:45:08,024 INFO L87 Difference]: Start difference. First operand 18577 states and 61446 transitions. Second operand 5 states. [2019-12-27 03:45:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:08,311 INFO L93 Difference]: Finished difference Result 19149 states and 62712 transitions. [2019-12-27 03:45:08,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:45:08,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:45:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:08,355 INFO L225 Difference]: With dead ends: 19149 [2019-12-27 03:45:08,356 INFO L226 Difference]: Without dead ends: 18775 [2019-12-27 03:45:08,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 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 03:45:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18775 states. [2019-12-27 03:45:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18775 to 18775. [2019-12-27 03:45:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18775 states. [2019-12-27 03:45:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18775 states to 18775 states and 61909 transitions. [2019-12-27 03:45:09,146 INFO L78 Accepts]: Start accepts. Automaton has 18775 states and 61909 transitions. Word has length 28 [2019-12-27 03:45:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:09,146 INFO L462 AbstractCegarLoop]: Abstraction has 18775 states and 61909 transitions. [2019-12-27 03:45:09,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:45:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 18775 states and 61909 transitions. [2019-12-27 03:45:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:45:09,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:09,157 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] [2019-12-27 03:45:09,157 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-27 03:45:09,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:09,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294035111] [2019-12-27 03:45:09,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:09,192 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 03:45:09,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294035111] [2019-12-27 03:45:09,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:09,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:45:09,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787434643] [2019-12-27 03:45:09,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:45:09,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:45:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:45:09,194 INFO L87 Difference]: Start difference. First operand 18775 states and 61909 transitions. Second operand 3 states. [2019-12-27 03:45:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:09,339 INFO L93 Difference]: Finished difference Result 24936 states and 81824 transitions. [2019-12-27 03:45:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:45:09,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 03:45:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:09,379 INFO L225 Difference]: With dead ends: 24936 [2019-12-27 03:45:09,379 INFO L226 Difference]: Without dead ends: 24936 [2019-12-27 03:45:09,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:45:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24936 states. [2019-12-27 03:45:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24936 to 19603. [2019-12-27 03:45:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19603 states. [2019-12-27 03:45:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19603 states to 19603 states and 63944 transitions. [2019-12-27 03:45:09,771 INFO L78 Accepts]: Start accepts. Automaton has 19603 states and 63944 transitions. Word has length 28 [2019-12-27 03:45:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:09,771 INFO L462 AbstractCegarLoop]: Abstraction has 19603 states and 63944 transitions. [2019-12-27 03:45:09,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:45:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19603 states and 63944 transitions. [2019-12-27 03:45:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:45:09,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:09,779 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] [2019-12-27 03:45:09,779 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-27 03:45:09,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:09,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222149733] [2019-12-27 03:45:09,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:09,859 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 03:45:09,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222149733] [2019-12-27 03:45:09,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:09,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:45:09,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954384868] [2019-12-27 03:45:09,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:45:09,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:45:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:45:09,861 INFO L87 Difference]: Start difference. First operand 19603 states and 63944 transitions. Second operand 5 states. [2019-12-27 03:45:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:09,943 INFO L93 Difference]: Finished difference Result 7817 states and 23872 transitions. [2019-12-27 03:45:09,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:45:09,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 03:45:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:09,956 INFO L225 Difference]: With dead ends: 7817 [2019-12-27 03:45:09,956 INFO L226 Difference]: Without dead ends: 6674 [2019-12-27 03:45:09,957 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 03:45:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2019-12-27 03:45:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 6607. [2019-12-27 03:45:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6607 states. [2019-12-27 03:45:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6607 states to 6607 states and 20051 transitions. [2019-12-27 03:45:10,074 INFO L78 Accepts]: Start accepts. Automaton has 6607 states and 20051 transitions. Word has length 29 [2019-12-27 03:45:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:10,074 INFO L462 AbstractCegarLoop]: Abstraction has 6607 states and 20051 transitions. [2019-12-27 03:45:10,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:45:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6607 states and 20051 transitions. [2019-12-27 03:45:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:45:10,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:10,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:45:10,081 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-27 03:45:10,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:10,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817073714] [2019-12-27 03:45:10,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:10,208 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 03:45:10,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817073714] [2019-12-27 03:45:10,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:10,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:45:10,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745833326] [2019-12-27 03:45:10,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:45:10,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:45:10,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:45:10,210 INFO L87 Difference]: Start difference. First operand 6607 states and 20051 transitions. Second operand 6 states. [2019-12-27 03:45:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:10,432 INFO L93 Difference]: Finished difference Result 6733 states and 20285 transitions. [2019-12-27 03:45:10,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:45:10,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:45:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:10,442 INFO L225 Difference]: With dead ends: 6733 [2019-12-27 03:45:10,443 INFO L226 Difference]: Without dead ends: 6506 [2019-12-27 03:45:10,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:45:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-12-27 03:45:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6506. [2019-12-27 03:45:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-12-27 03:45:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 19840 transitions. [2019-12-27 03:45:10,541 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 19840 transitions. Word has length 40 [2019-12-27 03:45:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:10,542 INFO L462 AbstractCegarLoop]: Abstraction has 6506 states and 19840 transitions. [2019-12-27 03:45:10,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:45:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 19840 transitions. [2019-12-27 03:45:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:45:10,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:10,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:45:10,549 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:10,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-27 03:45:10,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:10,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987062426] [2019-12-27 03:45:10,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:10,654 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 03:45:10,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987062426] [2019-12-27 03:45:10,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:10,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:45:10,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765072563] [2019-12-27 03:45:10,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:45:10,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:45:10,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:45:10,656 INFO L87 Difference]: Start difference. First operand 6506 states and 19840 transitions. Second operand 6 states. [2019-12-27 03:45:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:10,926 INFO L93 Difference]: Finished difference Result 6492 states and 19807 transitions. [2019-12-27 03:45:10,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:45:10,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 03:45:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:10,940 INFO L225 Difference]: With dead ends: 6492 [2019-12-27 03:45:10,941 INFO L226 Difference]: Without dead ends: 6150 [2019-12-27 03:45:10,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:45:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6150 states. [2019-12-27 03:45:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6150 to 6150. [2019-12-27 03:45:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6150 states. [2019-12-27 03:45:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 19149 transitions. [2019-12-27 03:45:11,116 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 19149 transitions. Word has length 41 [2019-12-27 03:45:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:11,116 INFO L462 AbstractCegarLoop]: Abstraction has 6150 states and 19149 transitions. [2019-12-27 03:45:11,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:45:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 19149 transitions. [2019-12-27 03:45:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:45:11,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:11,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:45:11,126 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1237610810, now seen corresponding path program 1 times [2019-12-27 03:45:11,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:11,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704226267] [2019-12-27 03:45:11,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:11,187 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 03:45:11,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704226267] [2019-12-27 03:45:11,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:11,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:45:11,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69558438] [2019-12-27 03:45:11,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:45:11,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:11,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:45:11,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:45:11,189 INFO L87 Difference]: Start difference. First operand 6150 states and 19149 transitions. Second operand 5 states. [2019-12-27 03:45:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:11,730 INFO L93 Difference]: Finished difference Result 11279 states and 34008 transitions. [2019-12-27 03:45:11,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:45:11,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 03:45:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:11,748 INFO L225 Difference]: With dead ends: 11279 [2019-12-27 03:45:11,748 INFO L226 Difference]: Without dead ends: 11279 [2019-12-27 03:45:11,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:45:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11279 states. [2019-12-27 03:45:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11279 to 8956. [2019-12-27 03:45:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8956 states. [2019-12-27 03:45:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8956 states to 8956 states and 27509 transitions. [2019-12-27 03:45:12,040 INFO L78 Accepts]: Start accepts. Automaton has 8956 states and 27509 transitions. Word has length 41 [2019-12-27 03:45:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:12,040 INFO L462 AbstractCegarLoop]: Abstraction has 8956 states and 27509 transitions. [2019-12-27 03:45:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:45:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8956 states and 27509 transitions. [2019-12-27 03:45:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 03:45:12,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:12,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:45:12,050 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 685009244, now seen corresponding path program 2 times [2019-12-27 03:45:12,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:12,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507164685] [2019-12-27 03:45:12,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:12,125 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 03:45:12,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507164685] [2019-12-27 03:45:12,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:12,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:45:12,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398469572] [2019-12-27 03:45:12,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:45:12,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:45:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:45:12,127 INFO L87 Difference]: Start difference. First operand 8956 states and 27509 transitions. Second operand 3 states. [2019-12-27 03:45:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:12,169 INFO L93 Difference]: Finished difference Result 8341 states and 25037 transitions. [2019-12-27 03:45:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:45:12,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 03:45:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:12,185 INFO L225 Difference]: With dead ends: 8341 [2019-12-27 03:45:12,186 INFO L226 Difference]: Without dead ends: 8341 [2019-12-27 03:45:12,186 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 03:45:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2019-12-27 03:45:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 8202. [2019-12-27 03:45:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8202 states. [2019-12-27 03:45:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 24638 transitions. [2019-12-27 03:45:12,363 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 24638 transitions. Word has length 41 [2019-12-27 03:45:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:12,363 INFO L462 AbstractCegarLoop]: Abstraction has 8202 states and 24638 transitions. [2019-12-27 03:45:12,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:45:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 24638 transitions. [2019-12-27 03:45:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 03:45:12,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:12,375 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] [2019-12-27 03:45:12,375 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 838446510, now seen corresponding path program 1 times [2019-12-27 03:45:12,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:12,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642345397] [2019-12-27 03:45:12,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:12,457 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 03:45:12,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642345397] [2019-12-27 03:45:12,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:12,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:45:12,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576578620] [2019-12-27 03:45:12,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:45:12,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:12,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:45:12,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:45:12,460 INFO L87 Difference]: Start difference. First operand 8202 states and 24638 transitions. Second operand 6 states. [2019-12-27 03:45:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:45:12,545 INFO L93 Difference]: Finished difference Result 7285 states and 22413 transitions. [2019-12-27 03:45:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:45:12,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 03:45:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:45:12,556 INFO L225 Difference]: With dead ends: 7285 [2019-12-27 03:45:12,556 INFO L226 Difference]: Without dead ends: 7186 [2019-12-27 03:45:12,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:45:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2019-12-27 03:45:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 7144. [2019-12-27 03:45:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7144 states. [2019-12-27 03:45:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 22071 transitions. [2019-12-27 03:45:12,666 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 22071 transitions. Word has length 42 [2019-12-27 03:45:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:45:12,666 INFO L462 AbstractCegarLoop]: Abstraction has 7144 states and 22071 transitions. [2019-12-27 03:45:12,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:45:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 22071 transitions. [2019-12-27 03:45:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:45:12,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:45:12,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:45:12,676 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:45:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:45:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-27 03:45:12,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:45:12,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664016546] [2019-12-27 03:45:12,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:45:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:45:13,474 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 03:45:13,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664016546] [2019-12-27 03:45:13,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:45:13,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:45:13,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006380498] [2019-12-27 03:45:13,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:45:13,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:45:13,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:45:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:45:13,476 INFO L87 Difference]: Start difference. First operand 7144 states and 22071 transitions. Second operand 16 states. Received shutdown request... [2019-12-27 03:45:14,375 WARN L209 SmtUtils]: Removed 7 from assertion stack [2019-12-27 03:45:14,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:45:14,375 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 03:45:14,378 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 03:45:14,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:45:14 BasicIcfg [2019-12-27 03:45:14,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:45:14,380 INFO L168 Benchmark]: Toolchain (without parser) took 194405.11 ms. Allocated memory was 144.2 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 03:45:14,381 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.2 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 03:45:14,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.69 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.8 MB in the beginning and 154.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:45:14,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.44 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:45:14,382 INFO L168 Benchmark]: Boogie Preprocessor took 66.94 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:45:14,383 INFO L168 Benchmark]: RCFGBuilder took 818.52 ms. Allocated memory is still 201.9 MB. Free memory was 149.3 MB in the beginning and 103.0 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:45:14,384 INFO L168 Benchmark]: TraceAbstraction took 192567.58 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 103.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 03:45:14,387 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.17 ms. Allocated memory is still 144.2 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.69 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.8 MB in the beginning and 154.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.44 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.94 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.52 ms. Allocated memory is still 201.9 MB. Free memory was 149.3 MB in the beginning and 103.0 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192567.58 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 103.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (7144states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 17 for 11ms.. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (7144states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 17 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 61.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2751 SDtfs, 2967 SDslu, 4321 SDs, 0 SdLazy, 2766 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 24 SyntacticMatches, 21 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 109.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 165413 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 97050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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