/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:07:24,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:07:24,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:07:24,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:07:24,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:07:24,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:07:24,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:07:24,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:07:24,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:07:24,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:07:24,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:07:24,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:07:24,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:07:24,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:07:24,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:07:24,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:07:24,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:07:24,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:07:24,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:07:24,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:07:24,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:07:24,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:07:24,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:07:24,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:07:24,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:07:24,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:07:24,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:07:24,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:07:24,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:07:24,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:07:24,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:07:24,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:07:24,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:07:24,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:07:24,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:07:24,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:07:24,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:07:24,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:07:24,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:07:24,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:07:24,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:07:24,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:07:24,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:07:24,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:07:24,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:07:24,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:07:24,559 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:07:24,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:07:24,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:07:24,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:07:24,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:07:24,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:07:24,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:07:24,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:07:24,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:07:24,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:07:24,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:07:24,562 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:07:24,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:07:24,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:07:24,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:07:24,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:07:24,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:07:24,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:07:24,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:07:24,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:07:24,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:07:24,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:07:24,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:07:24,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:07:24,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:07:24,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:07:24,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:07:24,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:07:24,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:07:24,854 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:07:24,854 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 03:07:24,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38345d49c/97779fa51bd746778b6b212c4aede44a/FLAG2b53cb1e9 [2019-12-27 03:07:25,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:07:25,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-27 03:07:25,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38345d49c/97779fa51bd746778b6b212c4aede44a/FLAG2b53cb1e9 [2019-12-27 03:07:25,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38345d49c/97779fa51bd746778b6b212c4aede44a [2019-12-27 03:07:25,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:07:25,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:07:25,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:07:25,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:07:25,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:07:25,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:07:25" (1/1) ... [2019-12-27 03:07:25,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1562cfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:25, skipping insertion in model container [2019-12-27 03:07:25,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:07:25" (1/1) ... [2019-12-27 03:07:25,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:07:25,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:07:26,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:07:26,464 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:07:26,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:07:26,638 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:07:26,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26 WrapperNode [2019-12-27 03:07:26,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:07:26,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:07:26,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:07:26,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:07:26,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:07:26,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:07:26,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:07:26,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:07:26,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... [2019-12-27 03:07:26,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:07:26,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:07:26,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:07:26,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:07:26,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:07:26,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:07:26,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:07:26,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:07:26,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:07:26,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:07:26,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:07:26,846 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:07:26,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:07:26,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:07:26,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:07:26,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:07:26,853 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:07:28,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:07:28,020 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:07:28,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:07:28 BoogieIcfgContainer [2019-12-27 03:07:28,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:07:28,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:07:28,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:07:28,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:07:28,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:07:25" (1/3) ... [2019-12-27 03:07:28,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12019397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:07:28, skipping insertion in model container [2019-12-27 03:07:28,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:26" (2/3) ... [2019-12-27 03:07:28,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12019397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:07:28, skipping insertion in model container [2019-12-27 03:07:28,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:07:28" (3/3) ... [2019-12-27 03:07:28,034 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc.i [2019-12-27 03:07:28,045 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:07:28,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:07:28,060 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:07:28,061 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:07:28,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,176 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,187 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:28,204 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:07:28,224 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:07:28,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:07:28,225 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:07:28,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:07:28,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:07:28,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:07:28,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:07:28,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:07:28,244 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 03:07:28,246 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 03:07:28,432 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 03:07:28,432 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:07:28,488 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 03:07:28,592 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 03:07:28,712 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 03:07:28,712 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:07:28,735 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 03:07:28,788 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 03:07:28,789 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:07:36,702 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:07:36,815 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 03:07:36,963 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 03:07:36,963 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 03:07:36,967 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 03:07:51,879 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 03:07:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 03:07:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:07:51,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:51,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:07:51,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 03:07:51,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:51,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9094060] [2019-12-27 03:07:51,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:52,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9094060] [2019-12-27 03:07:52,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:52,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:07:52,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066170166] [2019-12-27 03:07:52,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:52,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:52,192 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 03:07:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:56,000 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 03:07:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:56,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:07:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:56,767 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 03:07:56,767 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 03:07:56,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:08:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 03:08:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 03:08:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 03:08:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 03:08:09,141 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 03:08:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:09,142 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 03:08:09,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:08:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 03:08:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:08:09,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:09,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:09,147 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 03:08:09,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065850881] [2019-12-27 03:08:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:09,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065850881] [2019-12-27 03:08:09,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:09,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:08:09,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457073033] [2019-12-27 03:08:09,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:08:09,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:08:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:08:09,277 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-27 03:08:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:10,587 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 03:08:10,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:08:10,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:08:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:16,231 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 03:08:16,231 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 03:08:16,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 03:08:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 03:08:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 03:08:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 03:08:25,272 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 03:08:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:25,272 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 03:08:25,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:08:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 03:08:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:08:25,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:25,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:25,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 03:08:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:25,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763339015] [2019-12-27 03:08:25,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:25,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763339015] [2019-12-27 03:08:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:25,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:08:25,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68679317] [2019-12-27 03:08:25,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:08:25,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:25,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:08:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:08:25,382 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 03:08:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:31,689 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-27 03:08:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:08:31,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:08:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:32,196 INFO L225 Difference]: With dead ends: 198503 [2019-12-27 03:08:32,196 INFO L226 Difference]: Without dead ends: 198503 [2019-12-27 03:08:32,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-27 03:08:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-27 03:08:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-27 03:08:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-27 03:08:42,697 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-27 03:08:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:42,698 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-27 03:08:42,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:08:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-27 03:08:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:08:42,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:42,708 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 03:08:42,709 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-27 03:08:42,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:42,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571799120] [2019-12-27 03:08:42,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:42,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571799120] [2019-12-27 03:08:42,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:42,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:08:42,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527996] [2019-12-27 03:08:42,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:08:42,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:08:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:42,805 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-27 03:08:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:50,827 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-27 03:08:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:08:50,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 03:08:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:51,396 INFO L225 Difference]: With dead ends: 244942 [2019-12-27 03:08:51,396 INFO L226 Difference]: Without dead ends: 244942 [2019-12-27 03:08:51,397 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 03:08:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-27 03:09:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-27 03:09:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-27 03:09:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-27 03:09:04,324 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-27 03:09:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:04,324 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-27 03:09:04,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:09:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-27 03:09:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:09:04,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:04,350 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 03:09:04,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 03:09:04,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:04,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656524401] [2019-12-27 03:09:04,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:04,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656524401] [2019-12-27 03:09:04,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:04,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:09:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074994626] [2019-12-27 03:09:04,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:04,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:04,511 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 6 states. [2019-12-27 03:09:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:12,813 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-27 03:09:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:09:12,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 03:09:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:13,402 INFO L225 Difference]: With dead ends: 255390 [2019-12-27 03:09:13,402 INFO L226 Difference]: Without dead ends: 255390 [2019-12-27 03:09:13,403 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 03:09:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-27 03:09:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-27 03:09:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-27 03:09:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-27 03:09:26,379 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-27 03:09:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:26,380 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-27 03:09:26,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-27 03:09:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:09:26,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:26,402 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 03:09:26,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-27 03:09:26,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:26,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506938289] [2019-12-27 03:09:26,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:26,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506938289] [2019-12-27 03:09:26,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:26,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:09:26,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064560593] [2019-12-27 03:09:26,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:09:26,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:09:26,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:09:26,501 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-27 03:09:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:26,574 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-27 03:09:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:09:26,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:09:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:26,586 INFO L225 Difference]: With dead ends: 14741 [2019-12-27 03:09:26,586 INFO L226 Difference]: Without dead ends: 10693 [2019-12-27 03:09:26,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:09:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-27 03:09:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-27 03:09:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-27 03:09:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-27 03:09:26,726 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-27 03:09:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:26,726 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-27 03:09:26,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:09:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-27 03:09:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 03:09:26,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:26,732 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 03:09:26,732 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 03:09:26,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:26,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721402319] [2019-12-27 03:09:26,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:26,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721402319] [2019-12-27 03:09:26,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:26,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:09:26,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570625073] [2019-12-27 03:09:26,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:26,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:26,872 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 6 states. [2019-12-27 03:09:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:29,057 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-27 03:09:29,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:09:29,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-27 03:09:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:29,072 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 03:09:29,072 INFO L226 Difference]: Without dead ends: 11914 [2019-12-27 03:09:29,072 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 03:09:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-27 03:09:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-27 03:09:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-27 03:09:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-27 03:09:29,214 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-27 03:09:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:29,214 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-27 03:09:29,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-27 03:09:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 03:09:29,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:29,221 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 03:09:29,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 03:09:29,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:29,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955553787] [2019-12-27 03:09:29,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:29,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955553787] [2019-12-27 03:09:29,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:29,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:29,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110063800] [2019-12-27 03:09:29,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:09:29,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:09:29,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:09:29,422 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 8 states. [2019-12-27 03:09:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:30,924 INFO L93 Difference]: Finished difference Result 13314 states and 32232 transitions. [2019-12-27 03:09:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:09:30,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-27 03:09:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:30,940 INFO L225 Difference]: With dead ends: 13314 [2019-12-27 03:09:30,940 INFO L226 Difference]: Without dead ends: 13314 [2019-12-27 03:09:30,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 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 03:09:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2019-12-27 03:09:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 11791. [2019-12-27 03:09:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-27 03:09:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-27 03:09:31,082 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-27 03:09:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:31,082 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-27 03:09:31,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:09:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-27 03:09:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:09:31,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:31,091 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 03:09:31,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-27 03:09:31,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:31,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236852199] [2019-12-27 03:09:31,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:31,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236852199] [2019-12-27 03:09:31,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:31,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:09:31,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402426299] [2019-12-27 03:09:31,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:09:31,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:31,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:09:31,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:09:31,181 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-27 03:09:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:32,063 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-27 03:09:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:09:32,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 03:09:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:32,078 INFO L225 Difference]: With dead ends: 13152 [2019-12-27 03:09:32,078 INFO L226 Difference]: Without dead ends: 13152 [2019-12-27 03:09:32,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-27 03:09:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-27 03:09:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-27 03:09:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-27 03:09:32,233 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-27 03:09:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:32,234 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-27 03:09:32,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:09:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-27 03:09:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:09:32,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:32,243 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 03:09:32,243 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-27 03:09:32,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:32,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507424164] [2019-12-27 03:09:32,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:32,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507424164] [2019-12-27 03:09:32,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:32,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:09:32,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257019467] [2019-12-27 03:09:32,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:09:32,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:09:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:09:32,350 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-27 03:09:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:32,409 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-27 03:09:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:09:32,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 03:09:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:32,416 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 03:09:32,417 INFO L226 Difference]: Without dead ends: 5151 [2019-12-27 03:09:32,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-27 03:09:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-27 03:09:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 03:09:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-27 03:09:32,480 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-27 03:09:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:32,480 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-27 03:09:32,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:09:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-27 03:09:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:32,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:32,487 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 03:09:32,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 03:09:32,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:32,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363967607] [2019-12-27 03:09:32,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:34,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363967607] [2019-12-27 03:09:34,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:34,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:34,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246113891] [2019-12-27 03:09:34,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:34,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:34,400 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-27 03:09:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:35,179 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-27 03:09:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:09:35,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 03:09:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:35,189 INFO L225 Difference]: With dead ends: 6626 [2019-12-27 03:09:35,190 INFO L226 Difference]: Without dead ends: 6626 [2019-12-27 03:09:35,190 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 03:09:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-27 03:09:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-27 03:09:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-27 03:09:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-27 03:09:35,329 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-27 03:09:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:35,329 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-27 03:09:35,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-27 03:09:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:35,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:35,346 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 03:09:35,347 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:35,347 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-27 03:09:35,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:35,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836016683] [2019-12-27 03:09:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:35,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836016683] [2019-12-27 03:09:35,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:35,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:35,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090724759] [2019-12-27 03:09:35,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:35,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:35,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:35,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:35,565 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-27 03:09:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:36,740 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-27 03:09:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:09:36,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:09:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:36,749 INFO L225 Difference]: With dead ends: 7484 [2019-12-27 03:09:36,750 INFO L226 Difference]: Without dead ends: 7484 [2019-12-27 03:09:36,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-27 03:09:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-27 03:09:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-27 03:09:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-27 03:09:36,829 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-27 03:09:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:36,829 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-27 03:09:36,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-27 03:09:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:36,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:36,838 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 03:09:36,838 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-27 03:09:36,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:36,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360648659] [2019-12-27 03:09:36,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:36,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360648659] [2019-12-27 03:09:36,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:36,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:09:36,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397473687] [2019-12-27 03:09:36,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:09:36,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:09:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:09:36,953 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-27 03:09:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:37,483 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-27 03:09:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:09:37,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 03:09:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:37,492 INFO L225 Difference]: With dead ends: 7181 [2019-12-27 03:09:37,492 INFO L226 Difference]: Without dead ends: 7181 [2019-12-27 03:09:37,493 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 03:09:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-27 03:09:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-27 03:09:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-27 03:09:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-27 03:09:37,576 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-27 03:09:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:37,576 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-27 03:09:37,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:09:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-27 03:09:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:37,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:37,587 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 03:09:37,587 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-27 03:09:37,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:37,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2382053] [2019-12-27 03:09:37,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:37,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2382053] [2019-12-27 03:09:37,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:37,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:37,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629903991] [2019-12-27 03:09:37,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:37,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:37,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:37,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:37,703 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 6 states. [2019-12-27 03:09:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:38,356 INFO L93 Difference]: Finished difference Result 7132 states and 16535 transitions. [2019-12-27 03:09:38,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:09:38,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 03:09:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:38,366 INFO L225 Difference]: With dead ends: 7132 [2019-12-27 03:09:38,367 INFO L226 Difference]: Without dead ends: 7132 [2019-12-27 03:09:38,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 03:09:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2019-12-27 03:09:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 6891. [2019-12-27 03:09:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6891 states. [2019-12-27 03:09:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6891 states to 6891 states and 16087 transitions. [2019-12-27 03:09:38,488 INFO L78 Accepts]: Start accepts. Automaton has 6891 states and 16087 transitions. Word has length 94 [2019-12-27 03:09:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:38,488 INFO L462 AbstractCegarLoop]: Abstraction has 6891 states and 16087 transitions. [2019-12-27 03:09:38,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6891 states and 16087 transitions. [2019-12-27 03:09:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:38,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:38,499 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 03:09:38,499 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-27 03:09:38,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:38,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170705766] [2019-12-27 03:09:38,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:38,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170705766] [2019-12-27 03:09:38,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:38,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:38,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639877624] [2019-12-27 03:09:38,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:38,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:38,642 INFO L87 Difference]: Start difference. First operand 6891 states and 16087 transitions. Second operand 7 states. [2019-12-27 03:09:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:39,467 INFO L93 Difference]: Finished difference Result 19479 states and 46072 transitions. [2019-12-27 03:09:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:09:39,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:09:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:39,487 INFO L225 Difference]: With dead ends: 19479 [2019-12-27 03:09:39,487 INFO L226 Difference]: Without dead ends: 19479 [2019-12-27 03:09:39,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:09:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19479 states. [2019-12-27 03:09:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19479 to 7369. [2019-12-27 03:09:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7369 states. [2019-12-27 03:09:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7369 states to 7369 states and 17329 transitions. [2019-12-27 03:09:39,635 INFO L78 Accepts]: Start accepts. Automaton has 7369 states and 17329 transitions. Word has length 94 [2019-12-27 03:09:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:39,635 INFO L462 AbstractCegarLoop]: Abstraction has 7369 states and 17329 transitions. [2019-12-27 03:09:39,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 7369 states and 17329 transitions. [2019-12-27 03:09:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:39,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:39,645 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 03:09:39,645 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1832696303, now seen corresponding path program 6 times [2019-12-27 03:09:39,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:39,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691870784] [2019-12-27 03:09:39,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:39,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691870784] [2019-12-27 03:09:39,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:39,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:39,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309065379] [2019-12-27 03:09:39,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:39,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:39,748 INFO L87 Difference]: Start difference. First operand 7369 states and 17329 transitions. Second operand 6 states. [2019-12-27 03:09:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:40,637 INFO L93 Difference]: Finished difference Result 12275 states and 28172 transitions. [2019-12-27 03:09:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:09:40,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 03:09:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:40,651 INFO L225 Difference]: With dead ends: 12275 [2019-12-27 03:09:40,652 INFO L226 Difference]: Without dead ends: 12275 [2019-12-27 03:09:40,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:09:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12275 states. [2019-12-27 03:09:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12275 to 9247. [2019-12-27 03:09:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9247 states. [2019-12-27 03:09:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9247 states to 9247 states and 21913 transitions. [2019-12-27 03:09:40,774 INFO L78 Accepts]: Start accepts. Automaton has 9247 states and 21913 transitions. Word has length 94 [2019-12-27 03:09:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:40,775 INFO L462 AbstractCegarLoop]: Abstraction has 9247 states and 21913 transitions. [2019-12-27 03:09:40,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 9247 states and 21913 transitions. [2019-12-27 03:09:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:40,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:40,786 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 03:09:40,786 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:40,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 7 times [2019-12-27 03:09:40,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:40,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099825819] [2019-12-27 03:09:40,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:40,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099825819] [2019-12-27 03:09:40,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:40,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:40,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377789525] [2019-12-27 03:09:40,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:40,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:40,894 INFO L87 Difference]: Start difference. First operand 9247 states and 21913 transitions. Second operand 6 states. [2019-12-27 03:09:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:41,455 INFO L93 Difference]: Finished difference Result 9697 states and 22790 transitions. [2019-12-27 03:09:41,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:09:41,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 03:09:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:41,466 INFO L225 Difference]: With dead ends: 9697 [2019-12-27 03:09:41,467 INFO L226 Difference]: Without dead ends: 9697 [2019-12-27 03:09:41,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 03:09:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9697 states. [2019-12-27 03:09:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9697 to 9359. [2019-12-27 03:09:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9359 states. [2019-12-27 03:09:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9359 states to 9359 states and 22142 transitions. [2019-12-27 03:09:41,574 INFO L78 Accepts]: Start accepts. Automaton has 9359 states and 22142 transitions. Word has length 94 [2019-12-27 03:09:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:41,575 INFO L462 AbstractCegarLoop]: Abstraction has 9359 states and 22142 transitions. [2019-12-27 03:09:41,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9359 states and 22142 transitions. [2019-12-27 03:09:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:41,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:41,587 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 03:09:41,587 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2023312549, now seen corresponding path program 8 times [2019-12-27 03:09:41,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:41,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104034657] [2019-12-27 03:09:41,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:41,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104034657] [2019-12-27 03:09:41,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:41,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303298021] [2019-12-27 03:09:41,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:41,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:41,699 INFO L87 Difference]: Start difference. First operand 9359 states and 22142 transitions. Second operand 7 states. [2019-12-27 03:09:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:42,743 INFO L93 Difference]: Finished difference Result 12350 states and 28323 transitions. [2019-12-27 03:09:42,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:09:42,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:09:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:42,759 INFO L225 Difference]: With dead ends: 12350 [2019-12-27 03:09:42,759 INFO L226 Difference]: Without dead ends: 12350 [2019-12-27 03:09:42,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:09:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12350 states. [2019-12-27 03:09:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12350 to 9199. [2019-12-27 03:09:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-12-27 03:09:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 21782 transitions. [2019-12-27 03:09:42,936 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 21782 transitions. Word has length 94 [2019-12-27 03:09:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:42,936 INFO L462 AbstractCegarLoop]: Abstraction has 9199 states and 21782 transitions. [2019-12-27 03:09:42,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 21782 transitions. [2019-12-27 03:09:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:42,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:42,946 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 03:09:42,947 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -171487305, now seen corresponding path program 9 times [2019-12-27 03:09:42,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:42,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407902755] [2019-12-27 03:09:42,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:43,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407902755] [2019-12-27 03:09:43,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:43,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:43,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679915932] [2019-12-27 03:09:43,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:43,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:43,069 INFO L87 Difference]: Start difference. First operand 9199 states and 21782 transitions. Second operand 7 states. [2019-12-27 03:09:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:43,925 INFO L93 Difference]: Finished difference Result 12949 states and 30242 transitions. [2019-12-27 03:09:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:09:43,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:09:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:43,940 INFO L225 Difference]: With dead ends: 12949 [2019-12-27 03:09:43,940 INFO L226 Difference]: Without dead ends: 12949 [2019-12-27 03:09:43,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12949 states. [2019-12-27 03:09:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12949 to 9286. [2019-12-27 03:09:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 03:09:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 21992 transitions. [2019-12-27 03:09:44,054 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 21992 transitions. Word has length 94 [2019-12-27 03:09:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:44,054 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 21992 transitions. [2019-12-27 03:09:44,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 21992 transitions. [2019-12-27 03:09:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:09:44,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:44,064 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 03:09:44,065 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash 340897079, now seen corresponding path program 10 times [2019-12-27 03:09:44,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:44,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599389993] [2019-12-27 03:09:44,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:44,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599389993] [2019-12-27 03:09:44,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:44,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:44,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695475437] [2019-12-27 03:09:44,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:44,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:44,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:44,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:44,160 INFO L87 Difference]: Start difference. First operand 9286 states and 21992 transitions. Second operand 7 states. [2019-12-27 03:09:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:44,939 INFO L93 Difference]: Finished difference Result 12337 states and 28790 transitions. [2019-12-27 03:09:44,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:09:44,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:09:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:44,954 INFO L225 Difference]: With dead ends: 12337 [2019-12-27 03:09:44,954 INFO L226 Difference]: Without dead ends: 12337 [2019-12-27 03:09:44,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12337 states. [2019-12-27 03:09:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12337 to 9232. [2019-12-27 03:09:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9232 states. [2019-12-27 03:09:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9232 states to 9232 states and 21869 transitions. [2019-12-27 03:09:45,069 INFO L78 Accepts]: Start accepts. Automaton has 9232 states and 21869 transitions. Word has length 94 [2019-12-27 03:09:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:45,069 INFO L462 AbstractCegarLoop]: Abstraction has 9232 states and 21869 transitions. [2019-12-27 03:09:45,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 9232 states and 21869 transitions. [2019-12-27 03:09:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:09:45,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:45,078 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 03:09:45,078 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-27 03:09:45,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:45,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417254373] [2019-12-27 03:09:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:45,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417254373] [2019-12-27 03:09:45,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:45,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:45,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404817078] [2019-12-27 03:09:45,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:45,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:45,190 INFO L87 Difference]: Start difference. First operand 9232 states and 21869 transitions. Second operand 7 states. [2019-12-27 03:09:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:45,961 INFO L93 Difference]: Finished difference Result 10527 states and 24580 transitions. [2019-12-27 03:09:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:09:45,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 03:09:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:45,974 INFO L225 Difference]: With dead ends: 10527 [2019-12-27 03:09:45,974 INFO L226 Difference]: Without dead ends: 10527 [2019-12-27 03:09:45,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10527 states. [2019-12-27 03:09:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10527 to 9307. [2019-12-27 03:09:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9307 states. [2019-12-27 03:09:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9307 states to 9307 states and 22052 transitions. [2019-12-27 03:09:46,081 INFO L78 Accepts]: Start accepts. Automaton has 9307 states and 22052 transitions. Word has length 95 [2019-12-27 03:09:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:46,081 INFO L462 AbstractCegarLoop]: Abstraction has 9307 states and 22052 transitions. [2019-12-27 03:09:46,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9307 states and 22052 transitions. [2019-12-27 03:09:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:09:46,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:46,089 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 03:09:46,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1018864798, now seen corresponding path program 2 times [2019-12-27 03:09:46,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:46,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308090936] [2019-12-27 03:09:46,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:46,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308090936] [2019-12-27 03:09:46,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:46,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:46,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781567876] [2019-12-27 03:09:46,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:46,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:46,194 INFO L87 Difference]: Start difference. First operand 9307 states and 22052 transitions. Second operand 7 states. [2019-12-27 03:09:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:46,913 INFO L93 Difference]: Finished difference Result 10462 states and 24420 transitions. [2019-12-27 03:09:46,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:09:46,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 03:09:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:46,925 INFO L225 Difference]: With dead ends: 10462 [2019-12-27 03:09:46,925 INFO L226 Difference]: Without dead ends: 10462 [2019-12-27 03:09:46,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2019-12-27 03:09:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 9265. [2019-12-27 03:09:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9265 states. [2019-12-27 03:09:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9265 states to 9265 states and 21956 transitions. [2019-12-27 03:09:47,033 INFO L78 Accepts]: Start accepts. Automaton has 9265 states and 21956 transitions. Word has length 95 [2019-12-27 03:09:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:47,033 INFO L462 AbstractCegarLoop]: Abstraction has 9265 states and 21956 transitions. [2019-12-27 03:09:47,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9265 states and 21956 transitions. [2019-12-27 03:09:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:09:47,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:47,042 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 03:09:47,042 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 3 times [2019-12-27 03:09:47,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:47,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828949221] [2019-12-27 03:09:47,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:47,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828949221] [2019-12-27 03:09:47,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:47,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:47,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724115222] [2019-12-27 03:09:47,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:09:47,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:09:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:09:47,234 INFO L87 Difference]: Start difference. First operand 9265 states and 21956 transitions. Second operand 9 states. [2019-12-27 03:09:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:48,841 INFO L93 Difference]: Finished difference Result 14931 states and 35338 transitions. [2019-12-27 03:09:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:09:48,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-27 03:09:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:48,857 INFO L225 Difference]: With dead ends: 14931 [2019-12-27 03:09:48,857 INFO L226 Difference]: Without dead ends: 14931 [2019-12-27 03:09:48,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:09:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14931 states. [2019-12-27 03:09:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14931 to 10656. [2019-12-27 03:09:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10656 states. [2019-12-27 03:09:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10656 states to 10656 states and 25417 transitions. [2019-12-27 03:09:48,995 INFO L78 Accepts]: Start accepts. Automaton has 10656 states and 25417 transitions. Word has length 95 [2019-12-27 03:09:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:48,996 INFO L462 AbstractCegarLoop]: Abstraction has 10656 states and 25417 transitions. [2019-12-27 03:09:48,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:09:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10656 states and 25417 transitions. [2019-12-27 03:09:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:49,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:49,006 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] [2019-12-27 03:09:49,006 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-27 03:09:49,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:49,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229192496] [2019-12-27 03:09:49,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:49,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229192496] [2019-12-27 03:09:49,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:49,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:09:49,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546995956] [2019-12-27 03:09:49,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:49,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:49,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:49,106 INFO L87 Difference]: Start difference. First operand 10656 states and 25417 transitions. Second operand 6 states. [2019-12-27 03:09:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:49,288 INFO L93 Difference]: Finished difference Result 12756 states and 29945 transitions. [2019-12-27 03:09:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:09:49,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 03:09:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:49,303 INFO L225 Difference]: With dead ends: 12756 [2019-12-27 03:09:49,303 INFO L226 Difference]: Without dead ends: 11155 [2019-12-27 03:09:49,304 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 03:09:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11155 states. [2019-12-27 03:09:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11155 to 11067. [2019-12-27 03:09:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11067 states. [2019-12-27 03:09:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11067 states to 11067 states and 26387 transitions. [2019-12-27 03:09:49,427 INFO L78 Accepts]: Start accepts. Automaton has 11067 states and 26387 transitions. Word has length 96 [2019-12-27 03:09:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:49,428 INFO L462 AbstractCegarLoop]: Abstraction has 11067 states and 26387 transitions. [2019-12-27 03:09:49,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11067 states and 26387 transitions. [2019-12-27 03:09:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:49,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:49,438 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] [2019-12-27 03:09:49,438 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:49,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-27 03:09:49,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:49,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486189797] [2019-12-27 03:09:49,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:49,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486189797] [2019-12-27 03:09:49,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:49,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:49,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418660440] [2019-12-27 03:09:49,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:49,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:49,567 INFO L87 Difference]: Start difference. First operand 11067 states and 26387 transitions. Second operand 10 states. [2019-12-27 03:09:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:50,049 INFO L93 Difference]: Finished difference Result 18926 states and 45303 transitions. [2019-12-27 03:09:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 03:09:50,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:50,068 INFO L225 Difference]: With dead ends: 18926 [2019-12-27 03:09:50,068 INFO L226 Difference]: Without dead ends: 17395 [2019-12-27 03:09:50,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:09:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17395 states. [2019-12-27 03:09:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17395 to 14017. [2019-12-27 03:09:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14017 states. [2019-12-27 03:09:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14017 states to 14017 states and 34254 transitions. [2019-12-27 03:09:50,309 INFO L78 Accepts]: Start accepts. Automaton has 14017 states and 34254 transitions. Word has length 96 [2019-12-27 03:09:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:50,309 INFO L462 AbstractCegarLoop]: Abstraction has 14017 states and 34254 transitions. [2019-12-27 03:09:50,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14017 states and 34254 transitions. [2019-12-27 03:09:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:50,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:50,322 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] [2019-12-27 03:09:50,322 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1937169854, now seen corresponding path program 3 times [2019-12-27 03:09:50,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:50,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866973288] [2019-12-27 03:09:50,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:50,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866973288] [2019-12-27 03:09:50,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:50,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:09:50,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020633133] [2019-12-27 03:09:50,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:09:50,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:09:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:09:50,412 INFO L87 Difference]: Start difference. First operand 14017 states and 34254 transitions. Second operand 5 states. [2019-12-27 03:09:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:50,954 INFO L93 Difference]: Finished difference Result 17705 states and 43355 transitions. [2019-12-27 03:09:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:09:50,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 03:09:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:50,980 INFO L225 Difference]: With dead ends: 17705 [2019-12-27 03:09:50,980 INFO L226 Difference]: Without dead ends: 17705 [2019-12-27 03:09:50,981 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 03:09:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17705 states. [2019-12-27 03:09:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17705 to 14714. [2019-12-27 03:09:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14714 states. [2019-12-27 03:09:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 36048 transitions. [2019-12-27 03:09:51,195 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 36048 transitions. Word has length 96 [2019-12-27 03:09:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:51,195 INFO L462 AbstractCegarLoop]: Abstraction has 14714 states and 36048 transitions. [2019-12-27 03:09:51,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:09:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 36048 transitions. [2019-12-27 03:09:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:51,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:51,209 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] [2019-12-27 03:09:51,209 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:51,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-27 03:09:51,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:51,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840211978] [2019-12-27 03:09:51,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:51,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840211978] [2019-12-27 03:09:51,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:51,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:51,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194546374] [2019-12-27 03:09:51,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:51,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:51,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:51,383 INFO L87 Difference]: Start difference. First operand 14714 states and 36048 transitions. Second operand 10 states. [2019-12-27 03:09:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:52,372 INFO L93 Difference]: Finished difference Result 26266 states and 63599 transitions. [2019-12-27 03:09:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 03:09:52,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:52,409 INFO L225 Difference]: With dead ends: 26266 [2019-12-27 03:09:52,409 INFO L226 Difference]: Without dead ends: 24789 [2019-12-27 03:09:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:09:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24789 states. [2019-12-27 03:09:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24789 to 18453. [2019-12-27 03:09:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18453 states. [2019-12-27 03:09:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18453 states to 18453 states and 46240 transitions. [2019-12-27 03:09:52,693 INFO L78 Accepts]: Start accepts. Automaton has 18453 states and 46240 transitions. Word has length 96 [2019-12-27 03:09:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:52,693 INFO L462 AbstractCegarLoop]: Abstraction has 18453 states and 46240 transitions. [2019-12-27 03:09:52,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18453 states and 46240 transitions. [2019-12-27 03:09:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:52,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:52,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, 1] [2019-12-27 03:09:52,711 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 5 times [2019-12-27 03:09:52,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:52,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480496925] [2019-12-27 03:09:52,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:52,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480496925] [2019-12-27 03:09:52,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:52,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:52,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437457392] [2019-12-27 03:09:52,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:52,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:52,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:52,799 INFO L87 Difference]: Start difference. First operand 18453 states and 46240 transitions. Second operand 6 states. [2019-12-27 03:09:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:53,500 INFO L93 Difference]: Finished difference Result 22586 states and 56322 transitions. [2019-12-27 03:09:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:09:53,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 03:09:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:53,526 INFO L225 Difference]: With dead ends: 22586 [2019-12-27 03:09:53,526 INFO L226 Difference]: Without dead ends: 22586 [2019-12-27 03:09:53,527 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 03:09:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22586 states. [2019-12-27 03:09:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22586 to 18503. [2019-12-27 03:09:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18503 states. [2019-12-27 03:09:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18503 states to 18503 states and 46356 transitions. [2019-12-27 03:09:53,773 INFO L78 Accepts]: Start accepts. Automaton has 18503 states and 46356 transitions. Word has length 96 [2019-12-27 03:09:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:53,773 INFO L462 AbstractCegarLoop]: Abstraction has 18503 states and 46356 transitions. [2019-12-27 03:09:53,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 18503 states and 46356 transitions. [2019-12-27 03:09:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:53,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:53,792 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] [2019-12-27 03:09:53,793 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 6 times [2019-12-27 03:09:53,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:53,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763997476] [2019-12-27 03:09:53,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:54,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763997476] [2019-12-27 03:09:54,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:54,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:09:54,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658785782] [2019-12-27 03:09:54,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:09:54,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:09:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:09:54,047 INFO L87 Difference]: Start difference. First operand 18503 states and 46356 transitions. Second operand 13 states. [2019-12-27 03:09:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:54,930 INFO L93 Difference]: Finished difference Result 23066 states and 57163 transitions. [2019-12-27 03:09:54,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:09:54,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 03:09:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:54,956 INFO L225 Difference]: With dead ends: 23066 [2019-12-27 03:09:54,956 INFO L226 Difference]: Without dead ends: 23036 [2019-12-27 03:09:54,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:09:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23036 states. [2019-12-27 03:09:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23036 to 21689. [2019-12-27 03:09:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21689 states. [2019-12-27 03:09:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21689 states to 21689 states and 54320 transitions. [2019-12-27 03:09:55,233 INFO L78 Accepts]: Start accepts. Automaton has 21689 states and 54320 transitions. Word has length 96 [2019-12-27 03:09:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:55,233 INFO L462 AbstractCegarLoop]: Abstraction has 21689 states and 54320 transitions. [2019-12-27 03:09:55,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:09:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 21689 states and 54320 transitions. [2019-12-27 03:09:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:55,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:55,254 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] [2019-12-27 03:09:55,255 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash 471395218, now seen corresponding path program 7 times [2019-12-27 03:09:55,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:55,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774960554] [2019-12-27 03:09:55,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:55,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774960554] [2019-12-27 03:09:55,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:55,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:09:55,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835624286] [2019-12-27 03:09:55,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:55,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:55,348 INFO L87 Difference]: Start difference. First operand 21689 states and 54320 transitions. Second operand 6 states. [2019-12-27 03:09:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:56,159 INFO L93 Difference]: Finished difference Result 22715 states and 56401 transitions. [2019-12-27 03:09:56,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:09:56,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 03:09:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:56,184 INFO L225 Difference]: With dead ends: 22715 [2019-12-27 03:09:56,184 INFO L226 Difference]: Without dead ends: 22715 [2019-12-27 03:09:56,185 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 03:09:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22715 states. [2019-12-27 03:09:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22715 to 21871. [2019-12-27 03:09:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21871 states. [2019-12-27 03:09:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21871 states to 21871 states and 54710 transitions. [2019-12-27 03:09:56,455 INFO L78 Accepts]: Start accepts. Automaton has 21871 states and 54710 transitions. Word has length 96 [2019-12-27 03:09:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 21871 states and 54710 transitions. [2019-12-27 03:09:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21871 states and 54710 transitions. [2019-12-27 03:09:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:56,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:56,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] [2019-12-27 03:09:56,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 03:09:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1158479495, now seen corresponding path program 1 times [2019-12-27 03:09:56,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:56,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131562742] [2019-12-27 03:09:56,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:56,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131562742] [2019-12-27 03:09:56,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:56,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:09:56,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577278093] [2019-12-27 03:09:56,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:09:56,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:56,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:09:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:09:56,547 INFO L87 Difference]: Start difference. First operand 21871 states and 54710 transitions. Second operand 3 states. [2019-12-27 03:09:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:56,662 INFO L93 Difference]: Finished difference Result 21871 states and 54709 transitions. [2019-12-27 03:09:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:09:56,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-27 03:09:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:56,686 INFO L225 Difference]: With dead ends: 21871 [2019-12-27 03:09:56,686 INFO L226 Difference]: Without dead ends: 21871 [2019-12-27 03:09:56,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:09:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21871 states. [2019-12-27 03:09:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21871 to 20982. [2019-12-27 03:09:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20982 states. [2019-12-27 03:09:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20982 states to 20982 states and 52768 transitions. [2019-12-27 03:09:56,946 INFO L78 Accepts]: Start accepts. Automaton has 20982 states and 52768 transitions. Word has length 96 [2019-12-27 03:09:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:56,946 INFO L462 AbstractCegarLoop]: Abstraction has 20982 states and 52768 transitions. [2019-12-27 03:09:56,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:09:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 20982 states and 52768 transitions. [2019-12-27 03:09:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:56,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:56,968 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] [2019-12-27 03:09:56,968 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:56,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1234955586, now seen corresponding path program 8 times [2019-12-27 03:09:56,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:56,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034713677] [2019-12-27 03:09:56,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:57,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034713677] [2019-12-27 03:09:57,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:57,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:57,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809184546] [2019-12-27 03:09:57,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:57,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:57,135 INFO L87 Difference]: Start difference. First operand 20982 states and 52768 transitions. Second operand 10 states. [2019-12-27 03:09:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:58,300 INFO L93 Difference]: Finished difference Result 37125 states and 90843 transitions. [2019-12-27 03:09:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:09:58,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:58,342 INFO L225 Difference]: With dead ends: 37125 [2019-12-27 03:09:58,343 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 03:09:58,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 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 03:09:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 03:09:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 26785. [2019-12-27 03:09:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26785 states. [2019-12-27 03:09:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26785 states to 26785 states and 67968 transitions. [2019-12-27 03:09:58,867 INFO L78 Accepts]: Start accepts. Automaton has 26785 states and 67968 transitions. Word has length 96 [2019-12-27 03:09:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:58,868 INFO L462 AbstractCegarLoop]: Abstraction has 26785 states and 67968 transitions. [2019-12-27 03:09:58,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26785 states and 67968 transitions. [2019-12-27 03:09:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:58,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:58,894 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] [2019-12-27 03:09:58,894 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2113869856, now seen corresponding path program 9 times [2019-12-27 03:09:58,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:58,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796598734] [2019-12-27 03:09:58,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:59,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796598734] [2019-12-27 03:09:59,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:59,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:59,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224398465] [2019-12-27 03:09:59,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:59,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:59,028 INFO L87 Difference]: Start difference. First operand 26785 states and 67968 transitions. Second operand 10 states. [2019-12-27 03:09:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:59,691 INFO L93 Difference]: Finished difference Result 43244 states and 108348 transitions. [2019-12-27 03:09:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:09:59,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:59,739 INFO L225 Difference]: With dead ends: 43244 [2019-12-27 03:09:59,739 INFO L226 Difference]: Without dead ends: 41283 [2019-12-27 03:09:59,740 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 03:09:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41283 states. [2019-12-27 03:10:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41283 to 35637. [2019-12-27 03:10:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35637 states. [2019-12-27 03:10:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35637 states to 35637 states and 90951 transitions. [2019-12-27 03:10:00,236 INFO L78 Accepts]: Start accepts. Automaton has 35637 states and 90951 transitions. Word has length 96 [2019-12-27 03:10:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:00,236 INFO L462 AbstractCegarLoop]: Abstraction has 35637 states and 90951 transitions. [2019-12-27 03:10:00,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 35637 states and 90951 transitions. [2019-12-27 03:10:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:00,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:00,271 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] [2019-12-27 03:10:00,272 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1165421684, now seen corresponding path program 10 times [2019-12-27 03:10:00,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:00,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975347160] [2019-12-27 03:10:00,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:00,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975347160] [2019-12-27 03:10:00,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:00,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:10:00,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328025743] [2019-12-27 03:10:00,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:10:00,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:00,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:10:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:10:00,720 INFO L87 Difference]: Start difference. First operand 35637 states and 90951 transitions. Second operand 12 states. [2019-12-27 03:10:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:05,177 INFO L93 Difference]: Finished difference Result 69758 states and 174818 transitions. [2019-12-27 03:10:05,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 03:10:05,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 03:10:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:05,264 INFO L225 Difference]: With dead ends: 69758 [2019-12-27 03:10:05,264 INFO L226 Difference]: Without dead ends: 69701 [2019-12-27 03:10:05,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 03:10:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69701 states. [2019-12-27 03:10:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69701 to 46014. [2019-12-27 03:10:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46014 states. [2019-12-27 03:10:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46014 states to 46014 states and 117516 transitions. [2019-12-27 03:10:06,293 INFO L78 Accepts]: Start accepts. Automaton has 46014 states and 117516 transitions. Word has length 96 [2019-12-27 03:10:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:06,293 INFO L462 AbstractCegarLoop]: Abstraction has 46014 states and 117516 transitions. [2019-12-27 03:10:06,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:10:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 46014 states and 117516 transitions. [2019-12-27 03:10:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:06,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:06,341 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] [2019-12-27 03:10:06,341 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1131723738, now seen corresponding path program 11 times [2019-12-27 03:10:06,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:06,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190686616] [2019-12-27 03:10:06,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:06,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190686616] [2019-12-27 03:10:06,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:06,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:06,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033742477] [2019-12-27 03:10:06,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:06,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:06,503 INFO L87 Difference]: Start difference. First operand 46014 states and 117516 transitions. Second operand 10 states. [2019-12-27 03:10:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:07,915 INFO L93 Difference]: Finished difference Result 67828 states and 169981 transitions. [2019-12-27 03:10:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:10:07,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:10:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:07,998 INFO L225 Difference]: With dead ends: 67828 [2019-12-27 03:10:07,998 INFO L226 Difference]: Without dead ends: 67034 [2019-12-27 03:10:07,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:10:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67034 states. [2019-12-27 03:10:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67034 to 47195. [2019-12-27 03:10:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47195 states. [2019-12-27 03:10:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47195 states to 47195 states and 120466 transitions. [2019-12-27 03:10:09,056 INFO L78 Accepts]: Start accepts. Automaton has 47195 states and 120466 transitions. Word has length 96 [2019-12-27 03:10:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:09,056 INFO L462 AbstractCegarLoop]: Abstraction has 47195 states and 120466 transitions. [2019-12-27 03:10:09,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 47195 states and 120466 transitions. [2019-12-27 03:10:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:09,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:09,106 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] [2019-12-27 03:10:09,106 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash 353580028, now seen corresponding path program 12 times [2019-12-27 03:10:09,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:09,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839739516] [2019-12-27 03:10:09,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:09,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839739516] [2019-12-27 03:10:09,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:09,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:10:09,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603584008] [2019-12-27 03:10:09,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:09,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:09,307 INFO L87 Difference]: Start difference. First operand 47195 states and 120466 transitions. Second operand 10 states. [2019-12-27 03:10:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:10,724 INFO L93 Difference]: Finished difference Result 64986 states and 163298 transitions. [2019-12-27 03:10:10,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:10:10,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:10:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:10,809 INFO L225 Difference]: With dead ends: 64986 [2019-12-27 03:10:10,809 INFO L226 Difference]: Without dead ends: 64986 [2019-12-27 03:10:10,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:10:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64986 states. [2019-12-27 03:10:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64986 to 44483. [2019-12-27 03:10:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44483 states. [2019-12-27 03:10:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44483 states to 44483 states and 113295 transitions. [2019-12-27 03:10:11,765 INFO L78 Accepts]: Start accepts. Automaton has 44483 states and 113295 transitions. Word has length 96 [2019-12-27 03:10:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:11,765 INFO L462 AbstractCegarLoop]: Abstraction has 44483 states and 113295 transitions. [2019-12-27 03:10:11,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 44483 states and 113295 transitions. [2019-12-27 03:10:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:11,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:11,808 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] [2019-12-27 03:10:11,808 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 138397884, now seen corresponding path program 13 times [2019-12-27 03:10:11,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:11,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239675895] [2019-12-27 03:10:11,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:11,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239675895] [2019-12-27 03:10:11,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:11,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:11,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962740091] [2019-12-27 03:10:11,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:11,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:11,968 INFO L87 Difference]: Start difference. First operand 44483 states and 113295 transitions. Second operand 10 states. [2019-12-27 03:10:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:13,034 INFO L93 Difference]: Finished difference Result 59069 states and 146417 transitions. [2019-12-27 03:10:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:10:13,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:10:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:13,107 INFO L225 Difference]: With dead ends: 59069 [2019-12-27 03:10:13,107 INFO L226 Difference]: Without dead ends: 58381 [2019-12-27 03:10:13,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:10:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58381 states. [2019-12-27 03:10:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58381 to 41067. [2019-12-27 03:10:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41067 states. [2019-12-27 03:10:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41067 states to 41067 states and 103560 transitions. [2019-12-27 03:10:14,103 INFO L78 Accepts]: Start accepts. Automaton has 41067 states and 103560 transitions. Word has length 96 [2019-12-27 03:10:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:14,103 INFO L462 AbstractCegarLoop]: Abstraction has 41067 states and 103560 transitions. [2019-12-27 03:10:14,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41067 states and 103560 transitions. [2019-12-27 03:10:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:14,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:14,147 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] [2019-12-27 03:10:14,147 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -420289070, now seen corresponding path program 14 times [2019-12-27 03:10:14,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:14,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816626910] [2019-12-27 03:10:14,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:14,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816626910] [2019-12-27 03:10:14,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:14,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:14,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006905663] [2019-12-27 03:10:14,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:14,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:14,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:14,272 INFO L87 Difference]: Start difference. First operand 41067 states and 103560 transitions. Second operand 10 states. [2019-12-27 03:10:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:14,913 INFO L93 Difference]: Finished difference Result 55423 states and 138459 transitions. [2019-12-27 03:10:14,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:10:14,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:10:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:14,979 INFO L225 Difference]: With dead ends: 55423 [2019-12-27 03:10:14,980 INFO L226 Difference]: Without dead ends: 54551 [2019-12-27 03:10:14,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:10:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54551 states. [2019-12-27 03:10:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54551 to 41071. [2019-12-27 03:10:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41071 states. [2019-12-27 03:10:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41071 states to 41071 states and 103538 transitions. [2019-12-27 03:10:15,589 INFO L78 Accepts]: Start accepts. Automaton has 41071 states and 103538 transitions. Word has length 96 [2019-12-27 03:10:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:15,589 INFO L462 AbstractCegarLoop]: Abstraction has 41071 states and 103538 transitions. [2019-12-27 03:10:15,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 41071 states and 103538 transitions. [2019-12-27 03:10:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:15,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:15,628 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] [2019-12-27 03:10:15,628 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1771219286, now seen corresponding path program 15 times [2019-12-27 03:10:15,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:15,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795300032] [2019-12-27 03:10:15,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:15,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795300032] [2019-12-27 03:10:15,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:15,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:15,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63212167] [2019-12-27 03:10:15,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:15,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:15,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:15,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:15,748 INFO L87 Difference]: Start difference. First operand 41071 states and 103538 transitions. Second operand 10 states. [2019-12-27 03:10:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:16,625 INFO L93 Difference]: Finished difference Result 53067 states and 131694 transitions. [2019-12-27 03:10:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:10:16,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:10:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:16,687 INFO L225 Difference]: With dead ends: 53067 [2019-12-27 03:10:16,687 INFO L226 Difference]: Without dead ends: 52238 [2019-12-27 03:10:16,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:10:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52238 states. [2019-12-27 03:10:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52238 to 37002. [2019-12-27 03:10:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37002 states. [2019-12-27 03:10:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37002 states to 37002 states and 92482 transitions. [2019-12-27 03:10:17,226 INFO L78 Accepts]: Start accepts. Automaton has 37002 states and 92482 transitions. Word has length 96 [2019-12-27 03:10:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:17,227 INFO L462 AbstractCegarLoop]: Abstraction has 37002 states and 92482 transitions. [2019-12-27 03:10:17,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37002 states and 92482 transitions. [2019-12-27 03:10:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:17,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:17,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:17,262 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1834207958, now seen corresponding path program 16 times [2019-12-27 03:10:17,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:17,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790274035] [2019-12-27 03:10:17,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:17,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790274035] [2019-12-27 03:10:17,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:17,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:17,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713830345] [2019-12-27 03:10:17,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:10:17,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:10:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:10:17,538 INFO L87 Difference]: Start difference. First operand 37002 states and 92482 transitions. Second operand 9 states. [2019-12-27 03:10:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:19,007 INFO L93 Difference]: Finished difference Result 53387 states and 132742 transitions. [2019-12-27 03:10:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:10:19,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 03:10:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:19,074 INFO L225 Difference]: With dead ends: 53387 [2019-12-27 03:10:19,075 INFO L226 Difference]: Without dead ends: 53387 [2019-12-27 03:10:19,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:10:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53387 states. [2019-12-27 03:10:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53387 to 37172. [2019-12-27 03:10:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37172 states. [2019-12-27 03:10:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37172 states to 37172 states and 92871 transitions. [2019-12-27 03:10:19,805 INFO L78 Accepts]: Start accepts. Automaton has 37172 states and 92871 transitions. Word has length 96 [2019-12-27 03:10:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:19,806 INFO L462 AbstractCegarLoop]: Abstraction has 37172 states and 92871 transitions. [2019-12-27 03:10:19,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:10:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37172 states and 92871 transitions. [2019-12-27 03:10:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:19,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:19,855 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] [2019-12-27 03:10:19,855 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:19,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1370441944, now seen corresponding path program 17 times [2019-12-27 03:10:19,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:19,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245172711] [2019-12-27 03:10:19,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:20,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245172711] [2019-12-27 03:10:20,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:20,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:10:20,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089151635] [2019-12-27 03:10:20,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:10:20,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:20,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:10:20,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:10:20,077 INFO L87 Difference]: Start difference. First operand 37172 states and 92871 transitions. Second operand 13 states. [2019-12-27 03:10:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:22,252 INFO L93 Difference]: Finished difference Result 45268 states and 111093 transitions. [2019-12-27 03:10:22,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:10:22,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 03:10:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:22,307 INFO L225 Difference]: With dead ends: 45268 [2019-12-27 03:10:22,307 INFO L226 Difference]: Without dead ends: 43906 [2019-12-27 03:10:22,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:10:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43906 states. [2019-12-27 03:10:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43906 to 38123. [2019-12-27 03:10:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38123 states. [2019-12-27 03:10:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38123 states to 38123 states and 95049 transitions. [2019-12-27 03:10:22,836 INFO L78 Accepts]: Start accepts. Automaton has 38123 states and 95049 transitions. Word has length 96 [2019-12-27 03:10:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:22,837 INFO L462 AbstractCegarLoop]: Abstraction has 38123 states and 95049 transitions. [2019-12-27 03:10:22,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:10:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38123 states and 95049 transitions. [2019-12-27 03:10:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:10:22,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:22,877 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] [2019-12-27 03:10:22,877 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1096106513, now seen corresponding path program 1 times [2019-12-27 03:10:22,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:22,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787250394] [2019-12-27 03:10:22,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:22,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787250394] [2019-12-27 03:10:22,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:22,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:10:22,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269086402] [2019-12-27 03:10:22,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:10:22,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:22,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:10:22,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:10:22,934 INFO L87 Difference]: Start difference. First operand 38123 states and 95049 transitions. Second operand 3 states. [2019-12-27 03:10:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:23,186 INFO L93 Difference]: Finished difference Result 35903 states and 89841 transitions. [2019-12-27 03:10:23,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:10:23,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-27 03:10:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:23,226 INFO L225 Difference]: With dead ends: 35903 [2019-12-27 03:10:23,226 INFO L226 Difference]: Without dead ends: 35903 [2019-12-27 03:10:23,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:10:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35903 states. [2019-12-27 03:10:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35903 to 35889. [2019-12-27 03:10:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35889 states. [2019-12-27 03:10:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35889 states to 35889 states and 89815 transitions. [2019-12-27 03:10:23,651 INFO L78 Accepts]: Start accepts. Automaton has 35889 states and 89815 transitions. Word has length 96 [2019-12-27 03:10:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:23,652 INFO L462 AbstractCegarLoop]: Abstraction has 35889 states and 89815 transitions. [2019-12-27 03:10:23,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:10:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 35889 states and 89815 transitions. [2019-12-27 03:10:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:23,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:23,687 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 03:10:23,687 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:23,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-27 03:10:23,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:23,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64394688] [2019-12-27 03:10:23,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:23,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64394688] [2019-12-27 03:10:23,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:23,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:10:23,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125825737] [2019-12-27 03:10:23,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:10:23,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:10:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:10:23,999 INFO L87 Difference]: Start difference. First operand 35889 states and 89815 transitions. Second operand 16 states. [2019-12-27 03:10:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:29,478 INFO L93 Difference]: Finished difference Result 75026 states and 187274 transitions. [2019-12-27 03:10:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 03:10:29,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2019-12-27 03:10:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:29,553 INFO L225 Difference]: With dead ends: 75026 [2019-12-27 03:10:29,553 INFO L226 Difference]: Without dead ends: 63523 [2019-12-27 03:10:29,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=669, Invalid=4161, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 03:10:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63523 states. [2019-12-27 03:10:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63523 to 48274. [2019-12-27 03:10:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48274 states. [2019-12-27 03:10:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 122726 transitions. [2019-12-27 03:10:30,231 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 122726 transitions. Word has length 97 [2019-12-27 03:10:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:30,231 INFO L462 AbstractCegarLoop]: Abstraction has 48274 states and 122726 transitions. [2019-12-27 03:10:30,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:10:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 122726 transitions. [2019-12-27 03:10:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:30,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:30,278 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 03:10:30,278 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:30,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-27 03:10:30,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:30,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071094495] [2019-12-27 03:10:30,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:30,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071094495] [2019-12-27 03:10:30,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:30,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:10:30,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038670307] [2019-12-27 03:10:30,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:10:30,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:10:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:10:30,386 INFO L87 Difference]: Start difference. First operand 48274 states and 122726 transitions. Second operand 6 states. [2019-12-27 03:10:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:30,621 INFO L93 Difference]: Finished difference Result 47560 states and 120715 transitions. [2019-12-27 03:10:30,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:10:30,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 03:10:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:30,675 INFO L225 Difference]: With dead ends: 47560 [2019-12-27 03:10:30,675 INFO L226 Difference]: Without dead ends: 47560 [2019-12-27 03:10:30,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:10:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47560 states. [2019-12-27 03:10:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47560 to 43001. [2019-12-27 03:10:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43001 states. [2019-12-27 03:10:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43001 states to 43001 states and 109557 transitions. [2019-12-27 03:10:31,465 INFO L78 Accepts]: Start accepts. Automaton has 43001 states and 109557 transitions. Word has length 97 [2019-12-27 03:10:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:31,466 INFO L462 AbstractCegarLoop]: Abstraction has 43001 states and 109557 transitions. [2019-12-27 03:10:31,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:10:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 43001 states and 109557 transitions. [2019-12-27 03:10:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:31,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:31,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, 1, 1, 1] [2019-12-27 03:10:31,506 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-27 03:10:31,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:31,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510513029] [2019-12-27 03:10:31,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:31,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510513029] [2019-12-27 03:10:31,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:31,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:10:31,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407833989] [2019-12-27 03:10:31,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:10:31,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:31,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:10:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:10:31,622 INFO L87 Difference]: Start difference. First operand 43001 states and 109557 transitions. Second operand 7 states. [2019-12-27 03:10:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:32,617 INFO L93 Difference]: Finished difference Result 57522 states and 145594 transitions. [2019-12-27 03:10:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:10:32,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 03:10:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:32,687 INFO L225 Difference]: With dead ends: 57522 [2019-12-27 03:10:32,687 INFO L226 Difference]: Without dead ends: 57470 [2019-12-27 03:10:32,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 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 03:10:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57470 states. [2019-12-27 03:10:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57470 to 48409. [2019-12-27 03:10:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48409 states. [2019-12-27 03:10:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48409 states to 48409 states and 123261 transitions. [2019-12-27 03:10:33,368 INFO L78 Accepts]: Start accepts. Automaton has 48409 states and 123261 transitions. Word has length 97 [2019-12-27 03:10:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:33,368 INFO L462 AbstractCegarLoop]: Abstraction has 48409 states and 123261 transitions. [2019-12-27 03:10:33,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:10:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 48409 states and 123261 transitions. [2019-12-27 03:10:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:33,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:33,415 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 03:10:33,415 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-27 03:10:33,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:33,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146130181] [2019-12-27 03:10:33,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:33,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146130181] [2019-12-27 03:10:33,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:33,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:10:33,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194608972] [2019-12-27 03:10:33,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:10:33,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:10:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:10:33,535 INFO L87 Difference]: Start difference. First operand 48409 states and 123261 transitions. Second operand 8 states. [2019-12-27 03:10:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:34,629 INFO L93 Difference]: Finished difference Result 56694 states and 143121 transitions. [2019-12-27 03:10:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:10:34,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 03:10:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:34,694 INFO L225 Difference]: With dead ends: 56694 [2019-12-27 03:10:34,694 INFO L226 Difference]: Without dead ends: 56687 [2019-12-27 03:10:34,694 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 03:10:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56687 states. [2019-12-27 03:10:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56687 to 48185. [2019-12-27 03:10:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48185 states. [2019-12-27 03:10:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48185 states to 48185 states and 122708 transitions. [2019-12-27 03:10:35,346 INFO L78 Accepts]: Start accepts. Automaton has 48185 states and 122708 transitions. Word has length 97 [2019-12-27 03:10:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:35,346 INFO L462 AbstractCegarLoop]: Abstraction has 48185 states and 122708 transitions. [2019-12-27 03:10:35,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:10:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48185 states and 122708 transitions. [2019-12-27 03:10:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:35,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:35,392 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 03:10:35,393 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-27 03:10:35,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:35,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567680485] [2019-12-27 03:10:35,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:35,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567680485] [2019-12-27 03:10:35,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:35,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:10:35,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337049747] [2019-12-27 03:10:35,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:10:35,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:10:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:10:35,514 INFO L87 Difference]: Start difference. First operand 48185 states and 122708 transitions. Second operand 8 states. [2019-12-27 03:10:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:37,026 INFO L93 Difference]: Finished difference Result 68893 states and 174485 transitions. [2019-12-27 03:10:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:10:37,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 03:10:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:37,112 INFO L225 Difference]: With dead ends: 68893 [2019-12-27 03:10:37,112 INFO L226 Difference]: Without dead ends: 68879 [2019-12-27 03:10:37,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:10:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68879 states. [2019-12-27 03:10:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68879 to 50746. [2019-12-27 03:10:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50746 states. [2019-12-27 03:10:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50746 states to 50746 states and 129312 transitions. [2019-12-27 03:10:38,185 INFO L78 Accepts]: Start accepts. Automaton has 50746 states and 129312 transitions. Word has length 97 [2019-12-27 03:10:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:38,185 INFO L462 AbstractCegarLoop]: Abstraction has 50746 states and 129312 transitions. [2019-12-27 03:10:38,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:10:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 50746 states and 129312 transitions. [2019-12-27 03:10:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:38,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:38,236 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 03:10:38,236 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 4 times [2019-12-27 03:10:38,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:38,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777875643] [2019-12-27 03:10:38,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:38,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777875643] [2019-12-27 03:10:38,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:38,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 03:10:38,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778430779] [2019-12-27 03:10:38,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 03:10:38,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:38,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 03:10:38,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:10:38,977 INFO L87 Difference]: Start difference. First operand 50746 states and 129312 transitions. Second operand 24 states. [2019-12-27 03:10:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:50,408 INFO L93 Difference]: Finished difference Result 91750 states and 232931 transitions. [2019-12-27 03:10:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 03:10:50,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-27 03:10:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:50,546 INFO L225 Difference]: With dead ends: 91750 [2019-12-27 03:10:50,546 INFO L226 Difference]: Without dead ends: 87544 [2019-12-27 03:10:50,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2906 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=949, Invalid=8171, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 03:10:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87544 states. [2019-12-27 03:10:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87544 to 60131. [2019-12-27 03:10:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60131 states. [2019-12-27 03:10:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60131 states to 60131 states and 153774 transitions. [2019-12-27 03:10:51,906 INFO L78 Accepts]: Start accepts. Automaton has 60131 states and 153774 transitions. Word has length 97 [2019-12-27 03:10:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:51,906 INFO L462 AbstractCegarLoop]: Abstraction has 60131 states and 153774 transitions. [2019-12-27 03:10:51,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 03:10:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 60131 states and 153774 transitions. [2019-12-27 03:10:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:51,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:51,979 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 03:10:51,979 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1999136157, now seen corresponding path program 5 times [2019-12-27 03:10:51,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:51,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419083698] [2019-12-27 03:10:51,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:52,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419083698] [2019-12-27 03:10:52,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:52,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:10:52,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514758069] [2019-12-27 03:10:52,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:10:52,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:10:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:10:52,117 INFO L87 Difference]: Start difference. First operand 60131 states and 153774 transitions. Second operand 12 states. [2019-12-27 03:10:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:53,043 INFO L93 Difference]: Finished difference Result 70707 states and 179632 transitions. [2019-12-27 03:10:53,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:10:53,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-27 03:10:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:53,133 INFO L225 Difference]: With dead ends: 70707 [2019-12-27 03:10:53,133 INFO L226 Difference]: Without dead ends: 69564 [2019-12-27 03:10:53,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2019-12-27 03:10:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69564 states. Received shutdown request... [2019-12-27 03:10:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69564 to 60140. [2019-12-27 03:10:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60140 states. [2019-12-27 03:10:53,897 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 03:10:53,901 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 03:10:53,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:10:53 BasicIcfg [2019-12-27 03:10:53,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:10:53,903 INFO L168 Benchmark]: Toolchain (without parser) took 208101.42 ms. Allocated memory was 138.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,903 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.96 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 102.1 MB in the beginning and 155.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.60 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 151.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,905 INFO L168 Benchmark]: Boogie Preprocessor took 50.90 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,905 INFO L168 Benchmark]: RCFGBuilder took 1257.38 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 148.9 MB in the beginning and 193.1 MB in the end (delta: -44.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,905 INFO L168 Benchmark]: TraceAbstraction took 205878.46 ms. Allocated memory was 238.0 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 193.1 MB in the beginning and 1.2 GB in the end (delta: -984.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 03:10:53,908 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.96 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 102.1 MB in the beginning and 155.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.60 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 151.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.90 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1257.38 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 148.9 MB in the beginning and 193.1 MB in the end (delta: -44.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205878.46 ms. Allocated memory was 238.0 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 193.1 MB in the beginning and 1.2 GB in the end (delta: -984.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.7s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 205.6s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 95.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 21517 SDtfs, 26211 SDslu, 93688 SDs, 0 SdLazy, 46588 SolverSat, 1593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 192 SyntacticMatches, 67 SemanticMatches, 703 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5994 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240862occurred 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: 75.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 375547 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 4025 NumberOfCodeBlocks, 4025 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3976 ConstructedInterpolants, 0 QuantifiedInterpolants, 1207094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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