/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:04:27,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:04:27,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:04:27,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:04:27,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:04:27,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:04:27,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:04:27,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:04:27,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:04:27,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:04:27,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:04:27,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:04:27,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:04:27,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:04:27,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:04:27,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:04:27,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:04:27,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:04:27,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:04:27,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:04:27,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:04:27,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:04:27,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:04:27,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:04:27,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:04:27,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:04:27,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:04:27,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:04:27,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:04:27,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:04:27,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:04:27,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:04:27,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:04:27,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:04:27,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:04:27,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:04:27,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:04:27,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:04:27,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:04:27,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:04:27,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:04:27,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:04:27,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:04:27,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:04:27,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:04:27,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:04:27,710 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:04:27,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:04:27,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:04:27,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:04:27,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:04:27,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:04:27,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:04:27,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:04:27,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:04:27,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:04:27,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:04:27,714 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:04:27,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:04:27,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:04:27,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:04:27,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:04:27,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:04:27,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:27,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:04:27,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:04:27,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:04:27,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:04:27,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:04:27,717 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:04:27,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:04:27,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:04:28,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:04:28,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:04:28,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:04:28,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:04:28,034 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:04:28,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-27 07:04:28,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71df49d0/7e5818d78ec945e4ac1108e80f85bf4b/FLAGdc72d5950 [2019-12-27 07:04:28,625 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:04:28,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-27 07:04:28,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71df49d0/7e5818d78ec945e4ac1108e80f85bf4b/FLAGdc72d5950 [2019-12-27 07:04:28,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71df49d0/7e5818d78ec945e4ac1108e80f85bf4b [2019-12-27 07:04:28,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:04:28,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:04:28,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:28,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:04:28,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:04:28,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:28" (1/1) ... [2019-12-27 07:04:28,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1548a6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:28, skipping insertion in model container [2019-12-27 07:04:28,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:28" (1/1) ... [2019-12-27 07:04:28,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:04:29,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:04:29,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:29,601 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:04:29,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:29,760 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:04:29,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29 WrapperNode [2019-12-27 07:04:29,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:29,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:29,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:04:29,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:04:29,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:29,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:04:29,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:04:29,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:04:29,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (1/1) ... [2019-12-27 07:04:29,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:04:29,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:04:29,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:04:29,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:04:29,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (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 07:04:29,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:04:29,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:04:29,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:04:29,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:04:29,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:04:29,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:04:29,975 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:04:29,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:04:29,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:04:29,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:04:29,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:04:29,978 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 07:04:31,177 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:04:31,177 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:04:31,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:31 BoogieIcfgContainer [2019-12-27 07:04:31,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:04:31,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:04:31,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:04:31,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:04:31,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:28" (1/3) ... [2019-12-27 07:04:31,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dee819d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:31, skipping insertion in model container [2019-12-27 07:04:31,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:29" (2/3) ... [2019-12-27 07:04:31,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dee819d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:31, skipping insertion in model container [2019-12-27 07:04:31,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:31" (3/3) ... [2019-12-27 07:04:31,187 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc.i [2019-12-27 07:04:31,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:04:31,197 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:04:31,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:04:31,204 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:04:31,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:31,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:04:31,364 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:04:31,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:04:31,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:04:31,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:04:31,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:04:31,365 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:04:31,365 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:04:31,365 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:04:31,384 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 07:04:31,386 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 07:04:31,598 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 07:04:31,599 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:31,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 07:04:31,774 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 07:04:31,898 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 07:04:31,899 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:31,922 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 07:04:31,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 07:04:31,972 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:04:36,119 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:04:36,226 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:04:36,350 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-27 07:04:36,350 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-27 07:04:36,353 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-27 07:04:52,578 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-27 07:04:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-27 07:04:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:04:52,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:52,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:04:52,589 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-27 07:04:52,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:52,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261904807] [2019-12-27 07:04:52,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:52,864 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 07:04:52,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261904807] [2019-12-27 07:04:52,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:52,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:04:52,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423747588] [2019-12-27 07:04:52,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:52,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:52,895 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-27 07:04:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:54,028 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-27 07:04:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:54,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:04:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:57,885 INFO L225 Difference]: With dead ends: 120599 [2019-12-27 07:04:57,891 INFO L226 Difference]: Without dead ends: 118034 [2019-12-27 07:04:57,893 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 07:05:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-27 07:05:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-27 07:05:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-27 07:05:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-27 07:05:06,017 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-27 07:05:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:05:06,017 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-27 07:05:06,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:05:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-27 07:05:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:05:06,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:05:06,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:05:06,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:05:06,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:05:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-27 07:05:06,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:05:06,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524614123] [2019-12-27 07:05:06,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:05:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:05:06,118 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 07:05:06,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524614123] [2019-12-27 07:05:06,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:05:06,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:05:06,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545709749] [2019-12-27 07:05:06,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:05:06,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:05:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:05:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:05:06,126 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 4 states. [2019-12-27 07:05:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:05:10,662 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-27 07:05:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:05:10,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:05:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:05:11,030 INFO L225 Difference]: With dead ends: 156706 [2019-12-27 07:05:11,030 INFO L226 Difference]: Without dead ends: 156706 [2019-12-27 07:05:11,031 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 07:05:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-27 07:05:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-27 07:05:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-27 07:05:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-27 07:05:25,597 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-27 07:05:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:05:25,597 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-27 07:05:25,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:05:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-27 07:05:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:05:25,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:05:25,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:05:25,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:05:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:05:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-27 07:05:25,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:05:25,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499127577] [2019-12-27 07:05:25,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:05:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:05:25,673 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 07:05:25,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499127577] [2019-12-27 07:05:25,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:05:25,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:05:25,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258301435] [2019-12-27 07:05:25,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:05:25,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:05:25,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:05:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:05:25,675 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-27 07:05:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:05:27,109 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-27 07:05:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:05:27,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:05:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:05:33,624 INFO L225 Difference]: With dead ends: 203727 [2019-12-27 07:05:33,625 INFO L226 Difference]: Without dead ends: 203727 [2019-12-27 07:05:33,625 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 07:05:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-27 07:05:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-27 07:05:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-27 07:05:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-27 07:05:43,482 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-27 07:05:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:05:43,482 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-27 07:05:43,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:05:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-27 07:05:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:05:43,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:05:43,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:05:43,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:05:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:05:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-27 07:05:43,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:05:43,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198695218] [2019-12-27 07:05:43,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:05:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:05:43,574 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 07:05:43,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198695218] [2019-12-27 07:05:43,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:05:43,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:05:43,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456127329] [2019-12-27 07:05:43,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:05:43,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:05:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:05:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:05:43,577 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 5 states. [2019-12-27 07:05:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:05:46,758 INFO L93 Difference]: Finished difference Result 251197 states and 891926 transitions. [2019-12-27 07:05:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:05:46,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 07:05:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:05:47,365 INFO L225 Difference]: With dead ends: 251197 [2019-12-27 07:05:47,365 INFO L226 Difference]: Without dead ends: 251197 [2019-12-27 07:05:47,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:06:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251197 states. [2019-12-27 07:06:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251197 to 188159. [2019-12-27 07:06:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188159 states. [2019-12-27 07:06:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188159 states to 188159 states and 679985 transitions. [2019-12-27 07:06:04,855 INFO L78 Accepts]: Start accepts. Automaton has 188159 states and 679985 transitions. Word has length 17 [2019-12-27 07:06:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:04,856 INFO L462 AbstractCegarLoop]: Abstraction has 188159 states and 679985 transitions. [2019-12-27 07:06:04,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:06:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 188159 states and 679985 transitions. [2019-12-27 07:06:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:06:04,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:04,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:04,881 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-27 07:06:04,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:04,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575347951] [2019-12-27 07:06:04,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:05,033 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 07:06:05,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575347951] [2019-12-27 07:06:05,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:05,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:06:05,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20851072] [2019-12-27 07:06:05,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:06:05,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:06:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:06:05,035 INFO L87 Difference]: Start difference. First operand 188159 states and 679985 transitions. Second operand 6 states. [2019-12-27 07:06:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:13,305 INFO L93 Difference]: Finished difference Result 258327 states and 918716 transitions. [2019-12-27 07:06:13,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:06:13,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 07:06:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:13,905 INFO L225 Difference]: With dead ends: 258327 [2019-12-27 07:06:13,905 INFO L226 Difference]: Without dead ends: 258327 [2019-12-27 07:06:13,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:06:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258327 states. [2019-12-27 07:06:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258327 to 243454. [2019-12-27 07:06:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243454 states. [2019-12-27 07:06:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243454 states to 243454 states and 868009 transitions. [2019-12-27 07:06:24,949 INFO L78 Accepts]: Start accepts. Automaton has 243454 states and 868009 transitions. Word has length 25 [2019-12-27 07:06:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:24,950 INFO L462 AbstractCegarLoop]: Abstraction has 243454 states and 868009 transitions. [2019-12-27 07:06:24,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:06:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 243454 states and 868009 transitions. [2019-12-27 07:06:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:06:24,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:24,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:24,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 144894900, now seen corresponding path program 1 times [2019-12-27 07:06:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:24,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34668818] [2019-12-27 07:06:24,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:25,063 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 07:06:25,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34668818] [2019-12-27 07:06:25,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:25,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:06:25,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563954388] [2019-12-27 07:06:25,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:06:25,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:06:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:06:25,067 INFO L87 Difference]: Start difference. First operand 243454 states and 868009 transitions. Second operand 4 states. [2019-12-27 07:06:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:25,148 INFO L93 Difference]: Finished difference Result 14903 states and 40512 transitions. [2019-12-27 07:06:25,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:06:25,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:06:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:25,165 INFO L225 Difference]: With dead ends: 14903 [2019-12-27 07:06:25,166 INFO L226 Difference]: Without dead ends: 10760 [2019-12-27 07:06:25,166 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 07:06:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10760 states. [2019-12-27 07:06:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10760 to 10720. [2019-12-27 07:06:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10720 states. [2019-12-27 07:06:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 26331 transitions. [2019-12-27 07:06:25,295 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 26331 transitions. Word has length 25 [2019-12-27 07:06:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:25,295 INFO L462 AbstractCegarLoop]: Abstraction has 10720 states and 26331 transitions. [2019-12-27 07:06:25,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:06:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 26331 transitions. [2019-12-27 07:06:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 07:06:25,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:25,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:25,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-27 07:06:25,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:25,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508839799] [2019-12-27 07:06:25,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:25,386 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 07:06:25,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508839799] [2019-12-27 07:06:25,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:25,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:06:25,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410235535] [2019-12-27 07:06:25,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:06:25,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:06:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:06:25,388 INFO L87 Difference]: Start difference. First operand 10720 states and 26331 transitions. Second operand 6 states. [2019-12-27 07:06:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:28,012 INFO L93 Difference]: Finished difference Result 12029 states and 29137 transitions. [2019-12-27 07:06:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:06:28,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-27 07:06:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:28,027 INFO L225 Difference]: With dead ends: 12029 [2019-12-27 07:06:28,027 INFO L226 Difference]: Without dead ends: 11981 [2019-12-27 07:06:28,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 07:06:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-12-27 07:06:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11601. [2019-12-27 07:06:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-12-27 07:06:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 28281 transitions. [2019-12-27 07:06:28,151 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 28281 transitions. Word has length 38 [2019-12-27 07:06:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:28,151 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 28281 transitions. [2019-12-27 07:06:28,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:06:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 28281 transitions. [2019-12-27 07:06:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 07:06:28,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:28,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:28,158 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-27 07:06:28,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:28,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625107573] [2019-12-27 07:06:28,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:28,347 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 07:06:28,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625107573] [2019-12-27 07:06:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:28,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:06:28,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555099699] [2019-12-27 07:06:28,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:06:28,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:06:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:06:28,349 INFO L87 Difference]: Start difference. First operand 11601 states and 28281 transitions. Second operand 8 states. [2019-12-27 07:06:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:29,860 INFO L93 Difference]: Finished difference Result 13284 states and 32064 transitions. [2019-12-27 07:06:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:06:29,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-27 07:06:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:29,877 INFO L225 Difference]: With dead ends: 13284 [2019-12-27 07:06:29,877 INFO L226 Difference]: Without dead ends: 13284 [2019-12-27 07:06:29,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:06:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2019-12-27 07:06:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 11783. [2019-12-27 07:06:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-27 07:06:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-27 07:06:30,015 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-27 07:06:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:30,015 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-27 07:06:30,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:06:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-27 07:06:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 07:06:30,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:30,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:30,024 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:30,025 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-27 07:06:30,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:30,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45815511] [2019-12-27 07:06:30,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:30,128 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 07:06:30,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45815511] [2019-12-27 07:06:30,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:30,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:06:30,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962490767] [2019-12-27 07:06:30,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:06:30,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:06:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:06:30,131 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-27 07:06:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:31,037 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-27 07:06:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:06:31,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 07:06:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:31,053 INFO L225 Difference]: With dead ends: 13164 [2019-12-27 07:06:31,054 INFO L226 Difference]: Without dead ends: 13164 [2019-12-27 07:06:31,054 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 07:06:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-27 07:06:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-27 07:06:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-27 07:06:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-27 07:06:31,198 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-27 07:06:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:31,198 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-27 07:06:31,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:06:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-27 07:06:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 07:06:31,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:31,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:31,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-27 07:06:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744266087] [2019-12-27 07:06:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:31,303 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 07:06:31,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744266087] [2019-12-27 07:06:31,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:31,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:06:31,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611154231] [2019-12-27 07:06:31,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:06:31,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:06:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:06:31,305 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 5 states. [2019-12-27 07:06:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:31,360 INFO L93 Difference]: Finished difference Result 5514 states and 12816 transitions. [2019-12-27 07:06:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:06:31,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 07:06:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:31,367 INFO L225 Difference]: With dead ends: 5514 [2019-12-27 07:06:31,368 INFO L226 Difference]: Without dead ends: 5256 [2019-12-27 07:06:31,368 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 07:06:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2019-12-27 07:06:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5103. [2019-12-27 07:06:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-27 07:06:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11978 transitions. [2019-12-27 07:06:31,423 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11978 transitions. Word has length 58 [2019-12-27 07:06:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:31,423 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11978 transitions. [2019-12-27 07:06:31,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:06:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11978 transitions. [2019-12-27 07:06:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 07:06:31,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:31,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:31,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-27 07:06:31,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:31,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951634517] [2019-12-27 07:06:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:31,646 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 07:06:31,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951634517] [2019-12-27 07:06:31,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:31,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:06:31,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090844343] [2019-12-27 07:06:31,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:06:31,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:31,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:06:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:06:31,648 INFO L87 Difference]: Start difference. First operand 5103 states and 11978 transitions. Second operand 6 states. [2019-12-27 07:06:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:32,442 INFO L93 Difference]: Finished difference Result 6763 states and 15734 transitions. [2019-12-27 07:06:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:06:32,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 07:06:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:32,451 INFO L225 Difference]: With dead ends: 6763 [2019-12-27 07:06:32,451 INFO L226 Difference]: Without dead ends: 6763 [2019-12-27 07:06:32,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:06:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2019-12-27 07:06:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6314. [2019-12-27 07:06:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6314 states. [2019-12-27 07:06:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 14784 transitions. [2019-12-27 07:06:32,519 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 14784 transitions. Word has length 94 [2019-12-27 07:06:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:32,519 INFO L462 AbstractCegarLoop]: Abstraction has 6314 states and 14784 transitions. [2019-12-27 07:06:32,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:06:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 14784 transitions. [2019-12-27 07:06:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 07:06:32,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:32,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:32,527 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash 275007721, now seen corresponding path program 2 times [2019-12-27 07:06:32,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:32,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198819908] [2019-12-27 07:06:32,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:32,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 07:06:32,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198819908] [2019-12-27 07:06:32,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:32,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:06:32,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568044028] [2019-12-27 07:06:32,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:06:32,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:32,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:06:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:06:32,656 INFO L87 Difference]: Start difference. First operand 6314 states and 14784 transitions. Second operand 7 states. [2019-12-27 07:06:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:33,607 INFO L93 Difference]: Finished difference Result 7589 states and 17606 transitions. [2019-12-27 07:06:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:06:33,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 07:06:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:33,616 INFO L225 Difference]: With dead ends: 7589 [2019-12-27 07:06:33,617 INFO L226 Difference]: Without dead ends: 7589 [2019-12-27 07:06:33,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:06:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7589 states. [2019-12-27 07:06:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7589 to 6771. [2019-12-27 07:06:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6771 states. [2019-12-27 07:06:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 15811 transitions. [2019-12-27 07:06:33,695 INFO L78 Accepts]: Start accepts. Automaton has 6771 states and 15811 transitions. Word has length 94 [2019-12-27 07:06:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:33,695 INFO L462 AbstractCegarLoop]: Abstraction has 6771 states and 15811 transitions. [2019-12-27 07:06:33,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:06:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6771 states and 15811 transitions. [2019-12-27 07:06:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 07:06:33,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:33,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:33,708 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash -860704691, now seen corresponding path program 3 times [2019-12-27 07:06:33,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:33,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363863308] [2019-12-27 07:06:33,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:33,808 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 07:06:33,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363863308] [2019-12-27 07:06:33,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:33,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:06:33,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668384618] [2019-12-27 07:06:33,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:06:33,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:33,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:06:33,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:06:33,810 INFO L87 Difference]: Start difference. First operand 6771 states and 15811 transitions. Second operand 5 states. [2019-12-27 07:06:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:34,363 INFO L93 Difference]: Finished difference Result 7286 states and 16873 transitions. [2019-12-27 07:06:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:06:34,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 07:06:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:34,373 INFO L225 Difference]: With dead ends: 7286 [2019-12-27 07:06:34,373 INFO L226 Difference]: Without dead ends: 7286 [2019-12-27 07:06:34,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 07:06:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-12-27 07:06:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6912. [2019-12-27 07:06:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6912 states. [2019-12-27 07:06:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 16129 transitions. [2019-12-27 07:06:34,490 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 16129 transitions. Word has length 94 [2019-12-27 07:06:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:34,491 INFO L462 AbstractCegarLoop]: Abstraction has 6912 states and 16129 transitions. [2019-12-27 07:06:34,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:06:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 16129 transitions. [2019-12-27 07:06:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 07:06:34,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:34,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:34,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1714542913, now seen corresponding path program 4 times [2019-12-27 07:06:34,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:34,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064756109] [2019-12-27 07:06:34,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:34,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 07:06:34,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064756109] [2019-12-27 07:06:34,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:34,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:06:34,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877886956] [2019-12-27 07:06:34,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:06:34,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:06:34,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:06:34,830 INFO L87 Difference]: Start difference. First operand 6912 states and 16129 transitions. Second operand 9 states. [2019-12-27 07:06:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:35,616 INFO L93 Difference]: Finished difference Result 11962 states and 27785 transitions. [2019-12-27 07:06:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:06:35,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 07:06:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:35,628 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 07:06:35,628 INFO L226 Difference]: Without dead ends: 9792 [2019-12-27 07:06:35,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:06:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2019-12-27 07:06:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 8239. [2019-12-27 07:06:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8239 states. [2019-12-27 07:06:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 19439 transitions. [2019-12-27 07:06:35,721 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 19439 transitions. Word has length 94 [2019-12-27 07:06:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:35,722 INFO L462 AbstractCegarLoop]: Abstraction has 8239 states and 19439 transitions. [2019-12-27 07:06:35,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:06:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 19439 transitions. [2019-12-27 07:06:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 07:06:35,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:35,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:35,729 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 341553129, now seen corresponding path program 5 times [2019-12-27 07:06:35,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:35,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228740546] [2019-12-27 07:06:35,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:35,886 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 07:06:35,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228740546] [2019-12-27 07:06:35,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:35,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:06:35,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684904134] [2019-12-27 07:06:35,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:06:35,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:06:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:06:35,888 INFO L87 Difference]: Start difference. First operand 8239 states and 19439 transitions. Second operand 3 states. [2019-12-27 07:06:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:35,944 INFO L93 Difference]: Finished difference Result 8239 states and 19438 transitions. [2019-12-27 07:06:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:06:35,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 07:06:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:35,956 INFO L225 Difference]: With dead ends: 8239 [2019-12-27 07:06:35,956 INFO L226 Difference]: Without dead ends: 8239 [2019-12-27 07:06:35,956 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 07:06:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8239 states. [2019-12-27 07:06:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8239 to 8115. [2019-12-27 07:06:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8115 states. [2019-12-27 07:06:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8115 states to 8115 states and 19209 transitions. [2019-12-27 07:06:36,083 INFO L78 Accepts]: Start accepts. Automaton has 8115 states and 19209 transitions. Word has length 94 [2019-12-27 07:06:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:36,083 INFO L462 AbstractCegarLoop]: Abstraction has 8115 states and 19209 transitions. [2019-12-27 07:06:36,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:06:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8115 states and 19209 transitions. [2019-12-27 07:06:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:36,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:36,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:36,094 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash -510698891, now seen corresponding path program 1 times [2019-12-27 07:06:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:36,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265595714] [2019-12-27 07:06:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:36,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265595714] [2019-12-27 07:06:36,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:36,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:06:36,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212461224] [2019-12-27 07:06:36,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:06:36,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:06:36,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:06:36,263 INFO L87 Difference]: Start difference. First operand 8115 states and 19209 transitions. Second operand 10 states. [2019-12-27 07:06:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:37,298 INFO L93 Difference]: Finished difference Result 13099 states and 30865 transitions. [2019-12-27 07:06:37,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:06:37,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 07:06:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:37,311 INFO L225 Difference]: With dead ends: 13099 [2019-12-27 07:06:37,312 INFO L226 Difference]: Without dead ends: 11633 [2019-12-27 07:06:37,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:06:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11633 states. [2019-12-27 07:06:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11633 to 8284. [2019-12-27 07:06:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2019-12-27 07:06:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 19597 transitions. [2019-12-27 07:06:37,411 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 19597 transitions. Word has length 95 [2019-12-27 07:06:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:37,411 INFO L462 AbstractCegarLoop]: Abstraction has 8284 states and 19597 transitions. [2019-12-27 07:06:37,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:06:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 19597 transitions. [2019-12-27 07:06:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:37,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:37,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:37,420 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 800944117, now seen corresponding path program 2 times [2019-12-27 07:06:37,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:37,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79086905] [2019-12-27 07:06:37,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:37,583 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 07:06:37,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79086905] [2019-12-27 07:06:37,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:37,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:06:37,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959925162] [2019-12-27 07:06:37,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:06:37,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:06:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:06:37,585 INFO L87 Difference]: Start difference. First operand 8284 states and 19597 transitions. Second operand 10 states. [2019-12-27 07:06:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:38,534 INFO L93 Difference]: Finished difference Result 11479 states and 26814 transitions. [2019-12-27 07:06:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:06:38,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 07:06:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:38,546 INFO L225 Difference]: With dead ends: 11479 [2019-12-27 07:06:38,546 INFO L226 Difference]: Without dead ends: 8741 [2019-12-27 07:06:38,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:06:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8741 states. [2019-12-27 07:06:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8741 to 7495. [2019-12-27 07:06:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7495 states. [2019-12-27 07:06:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7495 states to 7495 states and 17451 transitions. [2019-12-27 07:06:38,629 INFO L78 Accepts]: Start accepts. Automaton has 7495 states and 17451 transitions. Word has length 95 [2019-12-27 07:06:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:38,630 INFO L462 AbstractCegarLoop]: Abstraction has 7495 states and 17451 transitions. [2019-12-27 07:06:38,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:06:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7495 states and 17451 transitions. [2019-12-27 07:06:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:38,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:38,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:38,637 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1807958155, now seen corresponding path program 3 times [2019-12-27 07:06:38,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:38,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420503908] [2019-12-27 07:06:38,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:38,723 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 07:06:38,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420503908] [2019-12-27 07:06:38,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:38,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:06:38,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740876043] [2019-12-27 07:06:38,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:06:38,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:38,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:06:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:06:38,725 INFO L87 Difference]: Start difference. First operand 7495 states and 17451 transitions. Second operand 6 states. [2019-12-27 07:06:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:39,439 INFO L93 Difference]: Finished difference Result 7905 states and 18255 transitions. [2019-12-27 07:06:39,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:06:39,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 07:06:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:39,450 INFO L225 Difference]: With dead ends: 7905 [2019-12-27 07:06:39,450 INFO L226 Difference]: Without dead ends: 7905 [2019-12-27 07:06:39,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:06:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7905 states. [2019-12-27 07:06:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7905 to 7399. [2019-12-27 07:06:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7399 states. [2019-12-27 07:06:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7399 states to 7399 states and 17257 transitions. [2019-12-27 07:06:39,537 INFO L78 Accepts]: Start accepts. Automaton has 7399 states and 17257 transitions. Word has length 95 [2019-12-27 07:06:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:39,537 INFO L462 AbstractCegarLoop]: Abstraction has 7399 states and 17257 transitions. [2019-12-27 07:06:39,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:06:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 7399 states and 17257 transitions. [2019-12-27 07:06:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:39,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:39,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:39,546 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash -954484805, now seen corresponding path program 4 times [2019-12-27 07:06:39,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:39,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495171497] [2019-12-27 07:06:39,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:39,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495171497] [2019-12-27 07:06:39,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:39,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:06:39,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076431768] [2019-12-27 07:06:39,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:06:39,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:06:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:06:39,711 INFO L87 Difference]: Start difference. First operand 7399 states and 17257 transitions. Second operand 7 states. [2019-12-27 07:06:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:40,594 INFO L93 Difference]: Finished difference Result 10623 states and 24967 transitions. [2019-12-27 07:06:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:06:40,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 07:06:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:40,607 INFO L225 Difference]: With dead ends: 10623 [2019-12-27 07:06:40,607 INFO L226 Difference]: Without dead ends: 10468 [2019-12-27 07:06:40,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:06:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10468 states. [2019-12-27 07:06:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10468 to 8085. [2019-12-27 07:06:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8085 states. [2019-12-27 07:06:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8085 states to 8085 states and 18768 transitions. [2019-12-27 07:06:40,702 INFO L78 Accepts]: Start accepts. Automaton has 8085 states and 18768 transitions. Word has length 95 [2019-12-27 07:06:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:40,702 INFO L462 AbstractCegarLoop]: Abstraction has 8085 states and 18768 transitions. [2019-12-27 07:06:40,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:06:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8085 states and 18768 transitions. [2019-12-27 07:06:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:40,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:40,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:40,711 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1330754899, now seen corresponding path program 5 times [2019-12-27 07:06:40,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:40,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154857432] [2019-12-27 07:06:40,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:40,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 07:06:40,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154857432] [2019-12-27 07:06:40,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:40,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:06:40,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532563373] [2019-12-27 07:06:40,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:06:40,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:06:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:06:40,861 INFO L87 Difference]: Start difference. First operand 8085 states and 18768 transitions. Second operand 9 states. [2019-12-27 07:06:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:42,257 INFO L93 Difference]: Finished difference Result 11422 states and 26798 transitions. [2019-12-27 07:06:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:06:42,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 07:06:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:42,271 INFO L225 Difference]: With dead ends: 11422 [2019-12-27 07:06:42,271 INFO L226 Difference]: Without dead ends: 11422 [2019-12-27 07:06:42,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:06:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11422 states. [2019-12-27 07:06:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11422 to 7518. [2019-12-27 07:06:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7518 states. [2019-12-27 07:06:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7518 states to 7518 states and 17489 transitions. [2019-12-27 07:06:42,365 INFO L78 Accepts]: Start accepts. Automaton has 7518 states and 17489 transitions. Word has length 95 [2019-12-27 07:06:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:42,365 INFO L462 AbstractCegarLoop]: Abstraction has 7518 states and 17489 transitions. [2019-12-27 07:06:42,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:06:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 7518 states and 17489 transitions. [2019-12-27 07:06:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:42,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:42,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:42,372 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1272736377, now seen corresponding path program 6 times [2019-12-27 07:06:42,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:42,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753942821] [2019-12-27 07:06:42,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:42,542 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 07:06:42,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753942821] [2019-12-27 07:06:42,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:42,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:06:42,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585845471] [2019-12-27 07:06:42,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:06:42,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:06:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:06:42,545 INFO L87 Difference]: Start difference. First operand 7518 states and 17489 transitions. Second operand 10 states. [2019-12-27 07:06:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:43,564 INFO L93 Difference]: Finished difference Result 17153 states and 39099 transitions. [2019-12-27 07:06:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:06:43,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 07:06:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:43,583 INFO L225 Difference]: With dead ends: 17153 [2019-12-27 07:06:43,583 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 07:06:43,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:06:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 07:06:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 9849. [2019-12-27 07:06:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2019-12-27 07:06:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 23328 transitions. [2019-12-27 07:06:43,728 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 23328 transitions. Word has length 95 [2019-12-27 07:06:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:43,728 INFO L462 AbstractCegarLoop]: Abstraction has 9849 states and 23328 transitions. [2019-12-27 07:06:43,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:06:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 23328 transitions. [2019-12-27 07:06:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:43,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:43,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:43,737 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:43,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1421503801, now seen corresponding path program 7 times [2019-12-27 07:06:43,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:43,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742003616] [2019-12-27 07:06:43,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:43,907 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 07:06:43,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742003616] [2019-12-27 07:06:43,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:43,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:06:43,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263622170] [2019-12-27 07:06:43,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:06:43,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:06:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:06:43,912 INFO L87 Difference]: Start difference. First operand 9849 states and 23328 transitions. Second operand 8 states. [2019-12-27 07:06:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:44,899 INFO L93 Difference]: Finished difference Result 14237 states and 32957 transitions. [2019-12-27 07:06:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:06:44,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 07:06:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:44,916 INFO L225 Difference]: With dead ends: 14237 [2019-12-27 07:06:44,916 INFO L226 Difference]: Without dead ends: 13974 [2019-12-27 07:06:44,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:06:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13974 states. [2019-12-27 07:06:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13974 to 11177. [2019-12-27 07:06:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11177 states. [2019-12-27 07:06:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11177 states to 11177 states and 26408 transitions. [2019-12-27 07:06:45,060 INFO L78 Accepts]: Start accepts. Automaton has 11177 states and 26408 transitions. Word has length 95 [2019-12-27 07:06:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:45,060 INFO L462 AbstractCegarLoop]: Abstraction has 11177 states and 26408 transitions. [2019-12-27 07:06:45,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:06:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 11177 states and 26408 transitions. [2019-12-27 07:06:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:45,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:45,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:45,071 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1494482243, now seen corresponding path program 8 times [2019-12-27 07:06:45,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:45,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099801567] [2019-12-27 07:06:45,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:45,174 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 07:06:45,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099801567] [2019-12-27 07:06:45,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:45,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:06:45,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082493529] [2019-12-27 07:06:45,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:06:45,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:45,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:06:45,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:06:45,176 INFO L87 Difference]: Start difference. First operand 11177 states and 26408 transitions. Second operand 8 states. [2019-12-27 07:06:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:46,436 INFO L93 Difference]: Finished difference Result 15455 states and 35780 transitions. [2019-12-27 07:06:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:06:46,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 07:06:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:46,455 INFO L225 Difference]: With dead ends: 15455 [2019-12-27 07:06:46,456 INFO L226 Difference]: Without dead ends: 15209 [2019-12-27 07:06:46,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:06:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15209 states. [2019-12-27 07:06:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15209 to 10562. [2019-12-27 07:06:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10562 states. [2019-12-27 07:06:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 24996 transitions. [2019-12-27 07:06:46,596 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 24996 transitions. Word has length 95 [2019-12-27 07:06:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:46,596 INFO L462 AbstractCegarLoop]: Abstraction has 10562 states and 24996 transitions. [2019-12-27 07:06:46,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:06:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 24996 transitions. [2019-12-27 07:06:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 07:06:46,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:46,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:46,606 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2063466195, now seen corresponding path program 9 times [2019-12-27 07:06:46,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:46,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384920504] [2019-12-27 07:06:46,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:46,692 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 07:06:46,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384920504] [2019-12-27 07:06:46,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:46,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:06:46,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580701865] [2019-12-27 07:06:46,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:06:46,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:46,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:06:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:06:46,695 INFO L87 Difference]: Start difference. First operand 10562 states and 24996 transitions. Second operand 7 states. [2019-12-27 07:06:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:47,023 INFO L93 Difference]: Finished difference Result 7311 states and 17462 transitions. [2019-12-27 07:06:47,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:06:47,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 07:06:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:47,033 INFO L225 Difference]: With dead ends: 7311 [2019-12-27 07:06:47,033 INFO L226 Difference]: Without dead ends: 7311 [2019-12-27 07:06:47,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:06:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2019-12-27 07:06:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 7206. [2019-12-27 07:06:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7206 states. [2019-12-27 07:06:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 17268 transitions. [2019-12-27 07:06:47,113 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 17268 transitions. Word has length 95 [2019-12-27 07:06:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:47,113 INFO L462 AbstractCegarLoop]: Abstraction has 7206 states and 17268 transitions. [2019-12-27 07:06:47,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:06:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 17268 transitions. [2019-12-27 07:06:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:47,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:47,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:47,121 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash 509064979, now seen corresponding path program 1 times [2019-12-27 07:06:47,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:47,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321420664] [2019-12-27 07:06:47,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:47,206 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 07:06:47,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321420664] [2019-12-27 07:06:47,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:47,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:06:47,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537467340] [2019-12-27 07:06:47,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:06:47,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:06:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:06:47,208 INFO L87 Difference]: Start difference. First operand 7206 states and 17268 transitions. Second operand 4 states. [2019-12-27 07:06:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:47,602 INFO L93 Difference]: Finished difference Result 8560 states and 20505 transitions. [2019-12-27 07:06:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:06:47,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-27 07:06:47,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:47,618 INFO L225 Difference]: With dead ends: 8560 [2019-12-27 07:06:47,619 INFO L226 Difference]: Without dead ends: 8560 [2019-12-27 07:06:47,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:06:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2019-12-27 07:06:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 8289. [2019-12-27 07:06:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2019-12-27 07:06:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 19888 transitions. [2019-12-27 07:06:47,813 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 19888 transitions. Word has length 97 [2019-12-27 07:06:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:47,813 INFO L462 AbstractCegarLoop]: Abstraction has 8289 states and 19888 transitions. [2019-12-27 07:06:47,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:06:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 19888 transitions. [2019-12-27 07:06:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:47,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:47,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:47,827 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1176229779, now seen corresponding path program 2 times [2019-12-27 07:06:47,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:47,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992409583] [2019-12-27 07:06:47,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:47,968 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 07:06:47,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992409583] [2019-12-27 07:06:47,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:47,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:06:47,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805714135] [2019-12-27 07:06:47,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:06:47,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:47,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:06:47,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:06:47,971 INFO L87 Difference]: Start difference. First operand 8289 states and 19888 transitions. Second operand 5 states. [2019-12-27 07:06:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:48,561 INFO L93 Difference]: Finished difference Result 10234 states and 24641 transitions. [2019-12-27 07:06:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:06:48,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 07:06:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:48,580 INFO L225 Difference]: With dead ends: 10234 [2019-12-27 07:06:48,580 INFO L226 Difference]: Without dead ends: 10234 [2019-12-27 07:06:48,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:06:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10234 states. [2019-12-27 07:06:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10234 to 8999. [2019-12-27 07:06:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8999 states. [2019-12-27 07:06:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8999 states to 8999 states and 21673 transitions. [2019-12-27 07:06:48,809 INFO L78 Accepts]: Start accepts. Automaton has 8999 states and 21673 transitions. Word has length 97 [2019-12-27 07:06:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:48,809 INFO L462 AbstractCegarLoop]: Abstraction has 8999 states and 21673 transitions. [2019-12-27 07:06:48,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:06:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8999 states and 21673 transitions. [2019-12-27 07:06:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:48,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:48,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:48,826 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:48,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash 627268243, now seen corresponding path program 3 times [2019-12-27 07:06:48,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:48,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515765405] [2019-12-27 07:06:48,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:49,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515765405] [2019-12-27 07:06:49,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:49,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:06:49,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841850382] [2019-12-27 07:06:49,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:06:49,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:06:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:06:49,013 INFO L87 Difference]: Start difference. First operand 8999 states and 21673 transitions. Second operand 7 states. [2019-12-27 07:06:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:50,066 INFO L93 Difference]: Finished difference Result 12860 states and 30947 transitions. [2019-12-27 07:06:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:06:50,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 07:06:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:50,082 INFO L225 Difference]: With dead ends: 12860 [2019-12-27 07:06:50,082 INFO L226 Difference]: Without dead ends: 12860 [2019-12-27 07:06:50,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:06:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12860 states. [2019-12-27 07:06:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12860 to 9655. [2019-12-27 07:06:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9655 states. [2019-12-27 07:06:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9655 states to 9655 states and 23296 transitions. [2019-12-27 07:06:50,204 INFO L78 Accepts]: Start accepts. Automaton has 9655 states and 23296 transitions. Word has length 97 [2019-12-27 07:06:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:50,204 INFO L462 AbstractCegarLoop]: Abstraction has 9655 states and 23296 transitions. [2019-12-27 07:06:50,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:06:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9655 states and 23296 transitions. [2019-12-27 07:06:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:50,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:50,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:50,213 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash 616330625, now seen corresponding path program 4 times [2019-12-27 07:06:50,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:50,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813039064] [2019-12-27 07:06:50,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:50,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813039064] [2019-12-27 07:06:50,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:50,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:06:50,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181498323] [2019-12-27 07:06:50,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:06:50,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:50,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:06:50,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:06:50,285 INFO L87 Difference]: Start difference. First operand 9655 states and 23296 transitions. Second operand 6 states. [2019-12-27 07:06:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:50,890 INFO L93 Difference]: Finished difference Result 12818 states and 31069 transitions. [2019-12-27 07:06:50,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:06:50,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 07:06:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:50,907 INFO L225 Difference]: With dead ends: 12818 [2019-12-27 07:06:50,907 INFO L226 Difference]: Without dead ends: 12818 [2019-12-27 07:06:50,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 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 07:06:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12818 states. [2019-12-27 07:06:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12818 to 10625. [2019-12-27 07:06:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-12-27 07:06:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 25782 transitions. [2019-12-27 07:06:51,041 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 25782 transitions. Word has length 97 [2019-12-27 07:06:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:51,041 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 25782 transitions. [2019-12-27 07:06:51,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:06:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 25782 transitions. [2019-12-27 07:06:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:51,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:51,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:51,051 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash 67369089, now seen corresponding path program 5 times [2019-12-27 07:06:51,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:51,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756060851] [2019-12-27 07:06:51,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:51,203 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 07:06:51,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756060851] [2019-12-27 07:06:51,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:51,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:06:51,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009451442] [2019-12-27 07:06:51,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:06:51,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:06:51,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:06:51,298 INFO L87 Difference]: Start difference. First operand 10625 states and 25782 transitions. Second operand 8 states. [2019-12-27 07:06:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:52,308 INFO L93 Difference]: Finished difference Result 13494 states and 32423 transitions. [2019-12-27 07:06:52,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:06:52,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 07:06:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:52,325 INFO L225 Difference]: With dead ends: 13494 [2019-12-27 07:06:52,325 INFO L226 Difference]: Without dead ends: 13494 [2019-12-27 07:06:52,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:06:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13494 states. [2019-12-27 07:06:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13494 to 9671. [2019-12-27 07:06:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 07:06:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 23334 transitions. [2019-12-27 07:06:52,450 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 23334 transitions. Word has length 97 [2019-12-27 07:06:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:52,450 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 23334 transitions. [2019-12-27 07:06:52,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:06:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 23334 transitions. [2019-12-27 07:06:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:52,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:52,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:52,459 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash 680862979, now seen corresponding path program 6 times [2019-12-27 07:06:52,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:52,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550745888] [2019-12-27 07:06:52,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:52,792 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 07:06:52,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550745888] [2019-12-27 07:06:52,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:52,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:06:52,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954017624] [2019-12-27 07:06:52,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:06:52,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:06:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:06:52,794 INFO L87 Difference]: Start difference. First operand 9671 states and 23334 transitions. Second operand 11 states. [2019-12-27 07:06:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:06:54,336 INFO L93 Difference]: Finished difference Result 12497 states and 29881 transitions. [2019-12-27 07:06:54,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:06:54,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-27 07:06:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:06:54,352 INFO L225 Difference]: With dead ends: 12497 [2019-12-27 07:06:54,352 INFO L226 Difference]: Without dead ends: 12497 [2019-12-27 07:06:54,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:06:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2019-12-27 07:06:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 9811. [2019-12-27 07:06:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9811 states. [2019-12-27 07:06:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 23650 transitions. [2019-12-27 07:06:54,468 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 23650 transitions. Word has length 97 [2019-12-27 07:06:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:06:54,469 INFO L462 AbstractCegarLoop]: Abstraction has 9811 states and 23650 transitions. [2019-12-27 07:06:54,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:06:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 23650 transitions. [2019-12-27 07:06:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:06:54,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:06:54,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:06:54,477 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:06:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:06:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1167481557, now seen corresponding path program 7 times [2019-12-27 07:06:54,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:06:54,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122243765] [2019-12-27 07:06:54,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:06:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:06:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:06:55,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122243765] [2019-12-27 07:06:55,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:06:55,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 07:06:55,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365579935] [2019-12-27 07:06:55,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 07:06:55,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:06:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 07:06:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:06:55,139 INFO L87 Difference]: Start difference. First operand 9811 states and 23650 transitions. Second operand 19 states. [2019-12-27 07:07:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:02,393 INFO L93 Difference]: Finished difference Result 31268 states and 76341 transitions. [2019-12-27 07:07:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 07:07:02,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-27 07:07:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:02,428 INFO L225 Difference]: With dead ends: 31268 [2019-12-27 07:07:02,428 INFO L226 Difference]: Without dead ends: 27499 [2019-12-27 07:07:02,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=698, Invalid=5002, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 07:07:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27499 states. [2019-12-27 07:07:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27499 to 13361. [2019-12-27 07:07:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13361 states. [2019-12-27 07:07:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13361 states to 13361 states and 32838 transitions. [2019-12-27 07:07:02,669 INFO L78 Accepts]: Start accepts. Automaton has 13361 states and 32838 transitions. Word has length 97 [2019-12-27 07:07:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:02,670 INFO L462 AbstractCegarLoop]: Abstraction has 13361 states and 32838 transitions. [2019-12-27 07:07:02,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 07:07:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 13361 states and 32838 transitions. [2019-12-27 07:07:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:02,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:02,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:02,682 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1808625369, now seen corresponding path program 8 times [2019-12-27 07:07:02,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:02,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87487723] [2019-12-27 07:07:02,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:02,914 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 07:07:02,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87487723] [2019-12-27 07:07:02,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:02,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:02,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477290158] [2019-12-27 07:07:02,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:02,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:02,917 INFO L87 Difference]: Start difference. First operand 13361 states and 32838 transitions. Second operand 10 states. [2019-12-27 07:07:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:03,676 INFO L93 Difference]: Finished difference Result 13825 states and 33750 transitions. [2019-12-27 07:07:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:07:03,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:03,694 INFO L225 Difference]: With dead ends: 13825 [2019-12-27 07:07:03,694 INFO L226 Difference]: Without dead ends: 13825 [2019-12-27 07:07:03,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:07:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13825 states. [2019-12-27 07:07:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13825 to 13298. [2019-12-27 07:07:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2019-12-27 07:07:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 32700 transitions. [2019-12-27 07:07:03,850 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 32700 transitions. Word has length 97 [2019-12-27 07:07:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:03,850 INFO L462 AbstractCegarLoop]: Abstraction has 13298 states and 32700 transitions. [2019-12-27 07:07:03,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 32700 transitions. [2019-12-27 07:07:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:03,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:03,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:03,863 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:03,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash 581708757, now seen corresponding path program 9 times [2019-12-27 07:07:03,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:03,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108149324] [2019-12-27 07:07:03,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:03,998 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 07:07:03,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108149324] [2019-12-27 07:07:03,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:03,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:03,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170856324] [2019-12-27 07:07:04,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:04,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:04,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:04,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:04,000 INFO L87 Difference]: Start difference. First operand 13298 states and 32700 transitions. Second operand 10 states. [2019-12-27 07:07:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:04,612 INFO L93 Difference]: Finished difference Result 20807 states and 50590 transitions. [2019-12-27 07:07:04,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 07:07:04,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:04,635 INFO L225 Difference]: With dead ends: 20807 [2019-12-27 07:07:04,635 INFO L226 Difference]: Without dead ends: 19524 [2019-12-27 07:07:04,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:07:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19524 states. [2019-12-27 07:07:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19524 to 17198. [2019-12-27 07:07:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17198 states. [2019-12-27 07:07:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17198 states to 17198 states and 42784 transitions. [2019-12-27 07:07:04,858 INFO L78 Accepts]: Start accepts. Automaton has 17198 states and 42784 transitions. Word has length 97 [2019-12-27 07:07:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:04,858 INFO L462 AbstractCegarLoop]: Abstraction has 17198 states and 42784 transitions. [2019-12-27 07:07:04,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17198 states and 42784 transitions. [2019-12-27 07:07:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:04,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:04,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:04,876 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1703353957, now seen corresponding path program 10 times [2019-12-27 07:07:04,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:04,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708356439] [2019-12-27 07:07:04,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:05,131 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 07:07:05,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708356439] [2019-12-27 07:07:05,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:05,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:07:05,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965806304] [2019-12-27 07:07:05,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:05,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:05,137 INFO L87 Difference]: Start difference. First operand 17198 states and 42784 transitions. Second operand 10 states. [2019-12-27 07:07:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:06,463 INFO L93 Difference]: Finished difference Result 24355 states and 59942 transitions. [2019-12-27 07:07:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:07:06,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:06,492 INFO L225 Difference]: With dead ends: 24355 [2019-12-27 07:07:06,492 INFO L226 Difference]: Without dead ends: 24355 [2019-12-27 07:07:06,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:07:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2019-12-27 07:07:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 19239. [2019-12-27 07:07:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19239 states. [2019-12-27 07:07:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19239 states to 19239 states and 47633 transitions. [2019-12-27 07:07:06,838 INFO L78 Accepts]: Start accepts. Automaton has 19239 states and 47633 transitions. Word has length 97 [2019-12-27 07:07:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:06,838 INFO L462 AbstractCegarLoop]: Abstraction has 19239 states and 47633 transitions. [2019-12-27 07:07:06,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 19239 states and 47633 transitions. [2019-12-27 07:07:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:06,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:06,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:06,857 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1603039107, now seen corresponding path program 11 times [2019-12-27 07:07:06,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:06,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812610762] [2019-12-27 07:07:06,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:07,007 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 07:07:07,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812610762] [2019-12-27 07:07:07,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:07,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:07,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536850607] [2019-12-27 07:07:07,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:07,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:07,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:07,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:07,008 INFO L87 Difference]: Start difference. First operand 19239 states and 47633 transitions. Second operand 10 states. [2019-12-27 07:07:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:07,920 INFO L93 Difference]: Finished difference Result 32843 states and 79730 transitions. [2019-12-27 07:07:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:07:07,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:07,958 INFO L225 Difference]: With dead ends: 32843 [2019-12-27 07:07:07,958 INFO L226 Difference]: Without dead ends: 32168 [2019-12-27 07:07:07,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:07:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32168 states. [2019-12-27 07:07:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32168 to 20255. [2019-12-27 07:07:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20255 states. [2019-12-27 07:07:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20255 states to 20255 states and 50224 transitions. [2019-12-27 07:07:08,274 INFO L78 Accepts]: Start accepts. Automaton has 20255 states and 50224 transitions. Word has length 97 [2019-12-27 07:07:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:08,274 INFO L462 AbstractCegarLoop]: Abstraction has 20255 states and 50224 transitions. [2019-12-27 07:07:08,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20255 states and 50224 transitions. [2019-12-27 07:07:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:08,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:08,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:08,294 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1847298937, now seen corresponding path program 12 times [2019-12-27 07:07:08,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:08,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703813358] [2019-12-27 07:07:08,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:08,450 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 07:07:08,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703813358] [2019-12-27 07:07:08,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:08,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:07:08,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679184456] [2019-12-27 07:07:08,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:07:08,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:07:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:07:08,452 INFO L87 Difference]: Start difference. First operand 20255 states and 50224 transitions. Second operand 8 states. [2019-12-27 07:07:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:08,784 INFO L93 Difference]: Finished difference Result 22874 states and 56028 transitions. [2019-12-27 07:07:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:07:08,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 07:07:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:08,809 INFO L225 Difference]: With dead ends: 22874 [2019-12-27 07:07:08,809 INFO L226 Difference]: Without dead ends: 21797 [2019-12-27 07:07:08,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:07:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21797 states. [2019-12-27 07:07:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21797 to 20496. [2019-12-27 07:07:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-12-27 07:07:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 50791 transitions. [2019-12-27 07:07:09,190 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 50791 transitions. Word has length 97 [2019-12-27 07:07:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:09,191 INFO L462 AbstractCegarLoop]: Abstraction has 20496 states and 50791 transitions. [2019-12-27 07:07:09,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:07:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 50791 transitions. [2019-12-27 07:07:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:09,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:09,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:09,211 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1039668075, now seen corresponding path program 13 times [2019-12-27 07:07:09,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:09,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568022483] [2019-12-27 07:07:09,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:09,351 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 07:07:09,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568022483] [2019-12-27 07:07:09,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:09,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:09,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143551501] [2019-12-27 07:07:09,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:09,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:09,355 INFO L87 Difference]: Start difference. First operand 20496 states and 50791 transitions. Second operand 10 states. [2019-12-27 07:07:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:09,889 INFO L93 Difference]: Finished difference Result 32296 states and 80659 transitions. [2019-12-27 07:07:09,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:07:09,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:09,927 INFO L225 Difference]: With dead ends: 32296 [2019-12-27 07:07:09,928 INFO L226 Difference]: Without dead ends: 31857 [2019-12-27 07:07:09,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:07:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31857 states. [2019-12-27 07:07:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31857 to 25374. [2019-12-27 07:07:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25374 states. [2019-12-27 07:07:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25374 states to 25374 states and 63854 transitions. [2019-12-27 07:07:10,287 INFO L78 Accepts]: Start accepts. Automaton has 25374 states and 63854 transitions. Word has length 97 [2019-12-27 07:07:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:10,287 INFO L462 AbstractCegarLoop]: Abstraction has 25374 states and 63854 transitions. [2019-12-27 07:07:10,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25374 states and 63854 transitions. [2019-12-27 07:07:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:10,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:10,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:10,313 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash 459587245, now seen corresponding path program 14 times [2019-12-27 07:07:10,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:10,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102122830] [2019-12-27 07:07:10,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:10,569 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 07:07:10,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102122830] [2019-12-27 07:07:10,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:10,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:07:10,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316509963] [2019-12-27 07:07:10,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:07:10,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:10,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:07:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:07:10,571 INFO L87 Difference]: Start difference. First operand 25374 states and 63854 transitions. Second operand 15 states. [2019-12-27 07:07:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:13,940 INFO L93 Difference]: Finished difference Result 46360 states and 117512 transitions. [2019-12-27 07:07:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 07:07:13,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-27 07:07:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:13,992 INFO L225 Difference]: With dead ends: 46360 [2019-12-27 07:07:13,992 INFO L226 Difference]: Without dead ends: 45750 [2019-12-27 07:07:13,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:07:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45750 states. [2019-12-27 07:07:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45750 to 35655. [2019-12-27 07:07:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35655 states. [2019-12-27 07:07:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35655 states to 35655 states and 91557 transitions. [2019-12-27 07:07:14,481 INFO L78 Accepts]: Start accepts. Automaton has 35655 states and 91557 transitions. Word has length 97 [2019-12-27 07:07:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:14,481 INFO L462 AbstractCegarLoop]: Abstraction has 35655 states and 91557 transitions. [2019-12-27 07:07:14,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:07:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35655 states and 91557 transitions. [2019-12-27 07:07:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:14,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:14,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:14,515 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:14,515 INFO L82 PathProgramCache]: Analyzing trace with hash -701982735, now seen corresponding path program 15 times [2019-12-27 07:07:14,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:14,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677732000] [2019-12-27 07:07:14,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:14,707 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 07:07:14,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677732000] [2019-12-27 07:07:14,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:14,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:07:14,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498582880] [2019-12-27 07:07:14,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:14,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:14,708 INFO L87 Difference]: Start difference. First operand 35655 states and 91557 transitions. Second operand 10 states. [2019-12-27 07:07:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:16,265 INFO L93 Difference]: Finished difference Result 47461 states and 120310 transitions. [2019-12-27 07:07:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:07:16,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:16,324 INFO L225 Difference]: With dead ends: 47461 [2019-12-27 07:07:16,324 INFO L226 Difference]: Without dead ends: 47461 [2019-12-27 07:07:16,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:07:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47461 states. [2019-12-27 07:07:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47461 to 35177. [2019-12-27 07:07:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35177 states. [2019-12-27 07:07:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35177 states to 35177 states and 90317 transitions. [2019-12-27 07:07:17,001 INFO L78 Accepts]: Start accepts. Automaton has 35177 states and 90317 transitions. Word has length 97 [2019-12-27 07:07:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:17,002 INFO L462 AbstractCegarLoop]: Abstraction has 35177 states and 90317 transitions. [2019-12-27 07:07:17,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35177 states and 90317 transitions. [2019-12-27 07:07:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:17,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:17,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:17,035 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash -93418067, now seen corresponding path program 16 times [2019-12-27 07:07:17,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:17,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158634187] [2019-12-27 07:07:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:17,350 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 07:07:17,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158634187] [2019-12-27 07:07:17,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:17,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:07:17,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602852674] [2019-12-27 07:07:17,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 07:07:17,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 07:07:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:07:17,351 INFO L87 Difference]: Start difference. First operand 35177 states and 90317 transitions. Second operand 14 states. [2019-12-27 07:07:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:20,002 INFO L93 Difference]: Finished difference Result 60378 states and 153858 transitions. [2019-12-27 07:07:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:07:20,002 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-27 07:07:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:20,090 INFO L225 Difference]: With dead ends: 60378 [2019-12-27 07:07:20,090 INFO L226 Difference]: Without dead ends: 60333 [2019-12-27 07:07:20,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-12-27 07:07:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60333 states. [2019-12-27 07:07:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60333 to 39942. [2019-12-27 07:07:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39942 states. [2019-12-27 07:07:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39942 states to 39942 states and 103415 transitions. [2019-12-27 07:07:20,956 INFO L78 Accepts]: Start accepts. Automaton has 39942 states and 103415 transitions. Word has length 97 [2019-12-27 07:07:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:20,956 INFO L462 AbstractCegarLoop]: Abstraction has 39942 states and 103415 transitions. [2019-12-27 07:07:20,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 07:07:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39942 states and 103415 transitions. [2019-12-27 07:07:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:20,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:20,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:20,995 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 699912021, now seen corresponding path program 17 times [2019-12-27 07:07:20,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:20,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562363566] [2019-12-27 07:07:20,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:21,207 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 07:07:21,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562363566] [2019-12-27 07:07:21,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:21,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:21,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668441203] [2019-12-27 07:07:21,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:21,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:21,209 INFO L87 Difference]: Start difference. First operand 39942 states and 103415 transitions. Second operand 10 states. [2019-12-27 07:07:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:22,483 INFO L93 Difference]: Finished difference Result 54498 states and 140259 transitions. [2019-12-27 07:07:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:07:22,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:22,554 INFO L225 Difference]: With dead ends: 54498 [2019-12-27 07:07:22,554 INFO L226 Difference]: Without dead ends: 54456 [2019-12-27 07:07:22,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:07:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54456 states. [2019-12-27 07:07:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54456 to 38787. [2019-12-27 07:07:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38787 states. [2019-12-27 07:07:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38787 states to 38787 states and 100253 transitions. [2019-12-27 07:07:23,482 INFO L78 Accepts]: Start accepts. Automaton has 38787 states and 100253 transitions. Word has length 97 [2019-12-27 07:07:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:23,482 INFO L462 AbstractCegarLoop]: Abstraction has 38787 states and 100253 transitions. [2019-12-27 07:07:23,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 38787 states and 100253 transitions. [2019-12-27 07:07:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:23,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:23,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:23,517 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 927356657, now seen corresponding path program 18 times [2019-12-27 07:07:23,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:23,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626071515] [2019-12-27 07:07:23,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:23,692 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 07:07:23,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626071515] [2019-12-27 07:07:23,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:23,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:07:23,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214086285] [2019-12-27 07:07:23,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:07:23,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:07:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:07:23,694 INFO L87 Difference]: Start difference. First operand 38787 states and 100253 transitions. Second operand 10 states. [2019-12-27 07:07:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:25,417 INFO L93 Difference]: Finished difference Result 46380 states and 118027 transitions. [2019-12-27 07:07:25,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:07:25,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 07:07:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:25,496 INFO L225 Difference]: With dead ends: 46380 [2019-12-27 07:07:25,497 INFO L226 Difference]: Without dead ends: 46335 [2019-12-27 07:07:25,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:07:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46335 states. [2019-12-27 07:07:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46335 to 28664. [2019-12-27 07:07:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28664 states. [2019-12-27 07:07:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28664 states to 28664 states and 73030 transitions. [2019-12-27 07:07:25,958 INFO L78 Accepts]: Start accepts. Automaton has 28664 states and 73030 transitions. Word has length 97 [2019-12-27 07:07:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:25,959 INFO L462 AbstractCegarLoop]: Abstraction has 28664 states and 73030 transitions. [2019-12-27 07:07:25,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:07:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 28664 states and 73030 transitions. [2019-12-27 07:07:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:25,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:25,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:25,986 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash -653317221, now seen corresponding path program 19 times [2019-12-27 07:07:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:25,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581232545] [2019-12-27 07:07:25,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:26,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581232545] [2019-12-27 07:07:26,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:26,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 07:07:26,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036185488] [2019-12-27 07:07:26,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:07:26,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:07:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:07:26,332 INFO L87 Difference]: Start difference. First operand 28664 states and 73030 transitions. Second operand 17 states. [2019-12-27 07:07:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:32,749 INFO L93 Difference]: Finished difference Result 37688 states and 94378 transitions. [2019-12-27 07:07:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 07:07:32,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2019-12-27 07:07:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:32,794 INFO L225 Difference]: With dead ends: 37688 [2019-12-27 07:07:32,795 INFO L226 Difference]: Without dead ends: 37538 [2019-12-27 07:07:32,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=771, Invalid=3921, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 07:07:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37538 states. [2019-12-27 07:07:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37538 to 29152. [2019-12-27 07:07:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29152 states. [2019-12-27 07:07:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29152 states to 29152 states and 74181 transitions. [2019-12-27 07:07:33,215 INFO L78 Accepts]: Start accepts. Automaton has 29152 states and 74181 transitions. Word has length 97 [2019-12-27 07:07:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:33,215 INFO L462 AbstractCegarLoop]: Abstraction has 29152 states and 74181 transitions. [2019-12-27 07:07:33,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:07:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 29152 states and 74181 transitions. [2019-12-27 07:07:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:33,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:33,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:33,244 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1814887201, now seen corresponding path program 20 times [2019-12-27 07:07:33,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:33,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687324356] [2019-12-27 07:07:33,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:33,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687324356] [2019-12-27 07:07:33,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:33,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:07:33,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600823724] [2019-12-27 07:07:33,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:07:33,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:33,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:07:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:07:33,396 INFO L87 Difference]: Start difference. First operand 29152 states and 74181 transitions. Second operand 9 states. [2019-12-27 07:07:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:34,913 INFO L93 Difference]: Finished difference Result 39412 states and 100210 transitions. [2019-12-27 07:07:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:07:34,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-27 07:07:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:34,960 INFO L225 Difference]: With dead ends: 39412 [2019-12-27 07:07:34,961 INFO L226 Difference]: Without dead ends: 39412 [2019-12-27 07:07:34,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:07:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39412 states. [2019-12-27 07:07:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39412 to 29330. [2019-12-27 07:07:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29330 states. [2019-12-27 07:07:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29330 states to 29330 states and 74601 transitions. [2019-12-27 07:07:35,412 INFO L78 Accepts]: Start accepts. Automaton has 29330 states and 74601 transitions. Word has length 97 [2019-12-27 07:07:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:35,412 INFO L462 AbstractCegarLoop]: Abstraction has 29330 states and 74601 transitions. [2019-12-27 07:07:35,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:07:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29330 states and 74601 transitions. [2019-12-27 07:07:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:35,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:35,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:35,442 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash 140012867, now seen corresponding path program 21 times [2019-12-27 07:07:35,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:35,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780870149] [2019-12-27 07:07:35,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:35,638 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 07:07:35,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780870149] [2019-12-27 07:07:35,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:35,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:07:35,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269878954] [2019-12-27 07:07:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:07:35,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:35,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:07:35,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:07:35,640 INFO L87 Difference]: Start difference. First operand 29330 states and 74601 transitions. Second operand 11 states. [2019-12-27 07:07:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:37,157 INFO L93 Difference]: Finished difference Result 37563 states and 94886 transitions. [2019-12-27 07:07:37,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:07:37,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-27 07:07:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:37,204 INFO L225 Difference]: With dead ends: 37563 [2019-12-27 07:07:37,204 INFO L226 Difference]: Without dead ends: 37563 [2019-12-27 07:07:37,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:07:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37563 states. [2019-12-27 07:07:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37563 to 29222. [2019-12-27 07:07:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29222 states. [2019-12-27 07:07:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29222 states to 29222 states and 74343 transitions. [2019-12-27 07:07:37,809 INFO L78 Accepts]: Start accepts. Automaton has 29222 states and 74343 transitions. Word has length 97 [2019-12-27 07:07:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:37,810 INFO L462 AbstractCegarLoop]: Abstraction has 29222 states and 74343 transitions. [2019-12-27 07:07:37,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:07:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 29222 states and 74343 transitions. [2019-12-27 07:07:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:37,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:37,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:37,840 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1076577071, now seen corresponding path program 22 times [2019-12-27 07:07:37,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:37,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709007126] [2019-12-27 07:07:37,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:07:38,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709007126] [2019-12-27 07:07:38,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:38,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:07:38,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522986934] [2019-12-27 07:07:38,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:07:38,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:07:38,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:07:38,417 INFO L87 Difference]: Start difference. First operand 29222 states and 74343 transitions. Second operand 20 states. [2019-12-27 07:07:38,544 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-27 07:07:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:43,178 INFO L93 Difference]: Finished difference Result 37631 states and 94555 transitions. [2019-12-27 07:07:43,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 07:07:43,179 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-27 07:07:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:43,223 INFO L225 Difference]: With dead ends: 37631 [2019-12-27 07:07:43,223 INFO L226 Difference]: Without dead ends: 35436 [2019-12-27 07:07:43,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=389, Invalid=2473, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 07:07:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35436 states. [2019-12-27 07:07:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35436 to 33150. [2019-12-27 07:07:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33150 states. [2019-12-27 07:07:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33150 states to 33150 states and 84515 transitions. [2019-12-27 07:07:43,788 INFO L78 Accepts]: Start accepts. Automaton has 33150 states and 84515 transitions. Word has length 97 [2019-12-27 07:07:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:43,789 INFO L462 AbstractCegarLoop]: Abstraction has 33150 states and 84515 transitions. [2019-12-27 07:07:43,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:07:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33150 states and 84515 transitions. [2019-12-27 07:07:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:43,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:43,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:07:43,821 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:43,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1106921475, now seen corresponding path program 23 times [2019-12-27 07:07:43,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:43,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358051454] [2019-12-27 07:07:43,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:44,686 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 07:07:44,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358051454] [2019-12-27 07:07:44,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:44,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 07:07:44,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720692025] [2019-12-27 07:07:44,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 07:07:44,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 07:07:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-12-27 07:07:44,689 INFO L87 Difference]: Start difference. First operand 33150 states and 84515 transitions. Second operand 21 states. [2019-12-27 07:07:44,905 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-27 07:07:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:50,892 INFO L93 Difference]: Finished difference Result 44183 states and 111716 transitions. [2019-12-27 07:07:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 07:07:50,892 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2019-12-27 07:07:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:50,980 INFO L225 Difference]: With dead ends: 44183 [2019-12-27 07:07:50,980 INFO L226 Difference]: Without dead ends: 42270 [2019-12-27 07:07:50,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=485, Invalid=3547, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 07:07:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42270 states. [2019-12-27 07:07:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42270 to 35454. [2019-12-27 07:07:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35454 states. [2019-12-27 07:07:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35454 states to 35454 states and 90687 transitions. [2019-12-27 07:07:51,726 INFO L78 Accepts]: Start accepts. Automaton has 35454 states and 90687 transitions. Word has length 97 [2019-12-27 07:07:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:07:51,726 INFO L462 AbstractCegarLoop]: Abstraction has 35454 states and 90687 transitions. [2019-12-27 07:07:51,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 07:07:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 35454 states and 90687 transitions. [2019-12-27 07:07:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 07:07:51,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:07:51,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:51,762 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:07:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:07:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 799107631, now seen corresponding path program 24 times [2019-12-27 07:07:51,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:07:51,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970899266] [2019-12-27 07:07:51,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:07:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:07:52,096 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 07:07:52,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970899266] [2019-12-27 07:07:52,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:07:52,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:07:52,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452155095] [2019-12-27 07:07:52,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 07:07:52,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:07:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 07:07:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:07:52,097 INFO L87 Difference]: Start difference. First operand 35454 states and 90687 transitions. Second operand 14 states. [2019-12-27 07:07:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:07:56,392 INFO L93 Difference]: Finished difference Result 68474 states and 173872 transitions. [2019-12-27 07:07:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 07:07:56,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-27 07:07:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:07:56,480 INFO L225 Difference]: With dead ends: 68474 [2019-12-27 07:07:56,480 INFO L226 Difference]: Without dead ends: 68474 [2019-12-27 07:07:56,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 07:07:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68474 states. Received shutdown request... [2019-12-27 07:07:56,945 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 07:07:56,947 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 07:07:56,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:07:56 BasicIcfg [2019-12-27 07:07:56,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:07:56,949 INFO L168 Benchmark]: Toolchain (without parser) took 208020.30 ms. Allocated memory was 145.2 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 99.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,949 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.49 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 152.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.46 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 149.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,950 INFO L168 Benchmark]: Boogie Preprocessor took 65.44 ms. Allocated memory is still 202.9 MB. Free memory was 149.4 MB in the beginning and 146.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,951 INFO L168 Benchmark]: RCFGBuilder took 1280.05 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 146.1 MB in the beginning and 189.6 MB in the end (delta: -43.4 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,951 INFO L168 Benchmark]: TraceAbstraction took 205767.63 ms. Allocated memory was 235.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 189.6 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:07:56,952 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.45 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.49 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 152.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.46 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 149.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.44 ms. Allocated memory is still 202.9 MB. Free memory was 149.4 MB in the beginning and 146.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1280.05 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 146.1 MB in the beginning and 189.6 MB in the end (delta: -43.4 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205767.63 ms. Allocated memory was 235.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 189.6 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 205.5s, OverallIterations: 48, TraceHistogramMax: 1, AutomataDifference: 100.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 21128 SDtfs, 29334 SDslu, 99423 SDs, 0 SdLazy, 55922 SolverSat, 1733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 166 SyntacticMatches, 80 SemanticMatches, 791 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6421 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243454occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.6s AutomataMinimizationTime, 48 MinimizatonAttempts, 289576 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 3950 NumberOfCodeBlocks, 3950 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3902 ConstructedInterpolants, 0 QuantifiedInterpolants, 1371730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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