/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/safe028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:07:28,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:07:28,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:07:29,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:07:29,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:07:29,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:07:29,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:07:29,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:07:29,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:07:29,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:07:29,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:07:29,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:07:29,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:07:29,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:07:29,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:07:29,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:07:29,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:07:29,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:07:29,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:07:29,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:07:29,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:07:29,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:07:29,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:07:29,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:07:29,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:07:29,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:07:29,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:07:29,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:07:29,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:07:29,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:07:29,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:07:29,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:07:29,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:07:29,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:07:29,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:07:29,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:07:29,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:07:29,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:07:29,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:07:29,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:07:29,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:07:29,084 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 04:07:29,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:07:29,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:07:29,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:07:29,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:07:29,105 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:07:29,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:07:29,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:07:29,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:07:29,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:07:29,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:07:29,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:07:29,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:07:29,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:07:29,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:07:29,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:07:29,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:07:29,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:07:29,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:07:29,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:07:29,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:07:29,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:07:29,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:07:29,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:07:29,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:07:29,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:07:29,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:07:29,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:07:29,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:07:29,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:07:29,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:07:29,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:07:29,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:07:29,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:07:29,472 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:07:29,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.opt.i [2019-12-27 04:07:29,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f25f33e/1eb583b7d6c442b59c6282aabb22a808/FLAG825374b17 [2019-12-27 04:07:30,073 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:07:30,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.opt.i [2019-12-27 04:07:30,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f25f33e/1eb583b7d6c442b59c6282aabb22a808/FLAG825374b17 [2019-12-27 04:07:30,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f25f33e/1eb583b7d6c442b59c6282aabb22a808 [2019-12-27 04:07:30,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:07:30,369 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:07:30,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:07:30,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:07:30,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:07:30,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:07:30" (1/1) ... [2019-12-27 04:07:30,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f959a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:30, skipping insertion in model container [2019-12-27 04:07:30,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:07:30" (1/1) ... [2019-12-27 04:07:30,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:07:30,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:07:31,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:07:31,077 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:07:31,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:07:31,242 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:07:31,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31 WrapperNode [2019-12-27 04:07:31,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:07:31,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:07:31,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:07:31,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:07:31,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:07:31,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:07:31,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:07:31,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:07:31,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (1/1) ... [2019-12-27 04:07:31,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:07:31,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:07:31,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:07:31,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:07:31,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (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 04:07:31,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 04:07:31,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:07:31,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:07:31,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:07:31,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:07:31,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:07:31,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:07:31,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:07:31,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:07:31,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:07:31,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:07:31,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 04:07:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:07:31,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:07:31,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:07:31,442 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 04:07:32,542 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:07:32,542 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 04:07:32,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:07:32 BoogieIcfgContainer [2019-12-27 04:07:32,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:07:32,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:07:32,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:07:32,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:07:32,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:07:30" (1/3) ... [2019-12-27 04:07:32,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dee160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:07:32, skipping insertion in model container [2019-12-27 04:07:32,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:07:31" (2/3) ... [2019-12-27 04:07:32,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dee160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:07:32, skipping insertion in model container [2019-12-27 04:07:32,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:07:32" (3/3) ... [2019-12-27 04:07:32,552 INFO L109 eAbstractionObserver]: Analyzing ICFG safe028_rmo.opt.i [2019-12-27 04:07:32,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:07:32,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:07:32,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:07:32,570 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:07:32,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,672 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,685 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:07:32,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 04:07:32,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:07:32,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:07:32,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:07:32,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:07:32,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:07:32,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:07:32,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:07:32,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:07:32,742 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 276 transitions [2019-12-27 04:07:32,744 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-27 04:07:32,889 INFO L132 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-27 04:07:32,889 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:07:32,916 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 646 event pairs. 0/209 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-27 04:07:32,963 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-27 04:07:33,104 INFO L132 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-27 04:07:33,104 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:07:33,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 646 event pairs. 0/209 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-27 04:07:33,150 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 32976 [2019-12-27 04:07:33,152 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:07:39,416 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-27 04:07:39,524 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 04:07:40,202 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-27 04:07:40,448 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-27 04:07:40,483 INFO L206 etLargeBlockEncoding]: Checked pairs total: 183707 [2019-12-27 04:07:40,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 146 [2019-12-27 04:07:40,486 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 138 transitions [2019-12-27 04:09:14,115 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 300418 states. [2019-12-27 04:09:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 300418 states. [2019-12-27 04:09:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:09:14,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:14,185 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 04:09:14,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2075695311, now seen corresponding path program 1 times [2019-12-27 04:09:14,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:14,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888404475] [2019-12-27 04:09:14,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:14,944 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 04:09:14,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888404475] [2019-12-27 04:09:14,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:14,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:09:14,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544460178] [2019-12-27 04:09:14,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:09:14,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:09:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:09:14,972 INFO L87 Difference]: Start difference. First operand 300418 states. Second operand 4 states. [2019-12-27 04:09:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:15,883 INFO L93 Difference]: Finished difference Result 73618 states and 281612 transitions. [2019-12-27 04:09:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:09:15,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 04:09:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:16,253 INFO L225 Difference]: With dead ends: 73618 [2019-12-27 04:09:16,254 INFO L226 Difference]: Without dead ends: 52546 [2019-12-27 04:09:16,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:09:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52546 states. [2019-12-27 04:09:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52546 to 52546. [2019-12-27 04:09:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52546 states. [2019-12-27 04:09:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52546 states to 52546 states and 190000 transitions. [2019-12-27 04:09:18,647 INFO L78 Accepts]: Start accepts. Automaton has 52546 states and 190000 transitions. Word has length 17 [2019-12-27 04:09:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:18,647 INFO L462 AbstractCegarLoop]: Abstraction has 52546 states and 190000 transitions. [2019-12-27 04:09:18,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:09:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 52546 states and 190000 transitions. [2019-12-27 04:09:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:09:18,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:18,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:09:18,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -583825164, now seen corresponding path program 1 times [2019-12-27 04:09:18,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:18,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652785897] [2019-12-27 04:09:18,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:18,893 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 04:09:18,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652785897] [2019-12-27 04:09:18,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:18,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:09:18,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735559462] [2019-12-27 04:09:18,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:09:18,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:18,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:09:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:18,897 INFO L87 Difference]: Start difference. First operand 52546 states and 190000 transitions. Second operand 3 states. [2019-12-27 04:09:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:19,142 INFO L93 Difference]: Finished difference Result 49978 states and 178400 transitions. [2019-12-27 04:09:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:09:19,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 04:09:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:19,421 INFO L225 Difference]: With dead ends: 49978 [2019-12-27 04:09:19,421 INFO L226 Difference]: Without dead ends: 49978 [2019-12-27 04:09:19,423 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 04:09:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2019-12-27 04:09:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49978. [2019-12-27 04:09:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49978 states. [2019-12-27 04:09:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49978 states to 49978 states and 178400 transitions. [2019-12-27 04:09:25,812 INFO L78 Accepts]: Start accepts. Automaton has 49978 states and 178400 transitions. Word has length 27 [2019-12-27 04:09:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:25,813 INFO L462 AbstractCegarLoop]: Abstraction has 49978 states and 178400 transitions. [2019-12-27 04:09:25,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:09:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 49978 states and 178400 transitions. [2019-12-27 04:09:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 04:09:25,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:25,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:09:25,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1333969975, now seen corresponding path program 1 times [2019-12-27 04:09:25,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:25,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699744874] [2019-12-27 04:09:25,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:26,025 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 04:09:26,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699744874] [2019-12-27 04:09:26,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:26,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:09:26,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340413626] [2019-12-27 04:09:26,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:09:26,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:09:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:09:26,027 INFO L87 Difference]: Start difference. First operand 49978 states and 178400 transitions. Second operand 5 states. [2019-12-27 04:09:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:26,187 INFO L93 Difference]: Finished difference Result 21608 states and 73798 transitions. [2019-12-27 04:09:26,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:09:26,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 04:09:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:26,238 INFO L225 Difference]: With dead ends: 21608 [2019-12-27 04:09:26,238 INFO L226 Difference]: Without dead ends: 19332 [2019-12-27 04:09:26,238 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 04:09:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19332 states. [2019-12-27 04:09:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19332 to 19332. [2019-12-27 04:09:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19332 states. [2019-12-27 04:09:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19332 states to 19332 states and 65970 transitions. [2019-12-27 04:09:26,839 INFO L78 Accepts]: Start accepts. Automaton has 19332 states and 65970 transitions. Word has length 28 [2019-12-27 04:09:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:26,840 INFO L462 AbstractCegarLoop]: Abstraction has 19332 states and 65970 transitions. [2019-12-27 04:09:26,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:09:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19332 states and 65970 transitions. [2019-12-27 04:09:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 04:09:26,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:26,880 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] [2019-12-27 04:09:26,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1164695851, now seen corresponding path program 1 times [2019-12-27 04:09:26,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:26,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522723284] [2019-12-27 04:09:26,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:27,010 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 04:09:27,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522723284] [2019-12-27 04:09:27,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:27,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:09:27,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785088260] [2019-12-27 04:09:27,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:09:27,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:27,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:09:27,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:09:27,015 INFO L87 Difference]: Start difference. First operand 19332 states and 65970 transitions. Second operand 5 states. [2019-12-27 04:09:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:27,700 INFO L93 Difference]: Finished difference Result 29379 states and 95597 transitions. [2019-12-27 04:09:27,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:09:27,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 04:09:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:27,750 INFO L225 Difference]: With dead ends: 29379 [2019-12-27 04:09:27,751 INFO L226 Difference]: Without dead ends: 29379 [2019-12-27 04:09:27,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 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 04:09:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29379 states. [2019-12-27 04:09:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29379 to 28917. [2019-12-27 04:09:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28917 states. [2019-12-27 04:09:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28917 states to 28917 states and 94496 transitions. [2019-12-27 04:09:29,410 INFO L78 Accepts]: Start accepts. Automaton has 28917 states and 94496 transitions. Word has length 44 [2019-12-27 04:09:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:29,412 INFO L462 AbstractCegarLoop]: Abstraction has 28917 states and 94496 transitions. [2019-12-27 04:09:29,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:09:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28917 states and 94496 transitions. [2019-12-27 04:09:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 04:09:29,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:29,475 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] [2019-12-27 04:09:29,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:29,475 INFO L82 PathProgramCache]: Analyzing trace with hash -541366890, now seen corresponding path program 1 times [2019-12-27 04:09:29,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:29,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294977293] [2019-12-27 04:09:29,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:29,675 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 04:09:29,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294977293] [2019-12-27 04:09:29,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:29,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:09:29,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958328552] [2019-12-27 04:09:29,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:09:29,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:09:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:09:29,678 INFO L87 Difference]: Start difference. First operand 28917 states and 94496 transitions. Second operand 6 states. [2019-12-27 04:09:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:29,874 INFO L93 Difference]: Finished difference Result 27531 states and 91082 transitions. [2019-12-27 04:09:29,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:09:29,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-27 04:09:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:29,939 INFO L225 Difference]: With dead ends: 27531 [2019-12-27 04:09:29,939 INFO L226 Difference]: Without dead ends: 27353 [2019-12-27 04:09:29,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:09:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27353 states. [2019-12-27 04:09:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27353 to 26789. [2019-12-27 04:09:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26789 states. [2019-12-27 04:09:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26789 states to 26789 states and 89120 transitions. [2019-12-27 04:09:30,577 INFO L78 Accepts]: Start accepts. Automaton has 26789 states and 89120 transitions. Word has length 45 [2019-12-27 04:09:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:30,577 INFO L462 AbstractCegarLoop]: Abstraction has 26789 states and 89120 transitions. [2019-12-27 04:09:30,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:09:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 26789 states and 89120 transitions. [2019-12-27 04:09:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 04:09:30,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:30,612 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] [2019-12-27 04:09:30,612 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash 328771059, now seen corresponding path program 1 times [2019-12-27 04:09:30,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:30,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592967739] [2019-12-27 04:09:30,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:30,699 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 04:09:30,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592967739] [2019-12-27 04:09:30,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:30,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:09:30,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450205774] [2019-12-27 04:09:30,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:09:30,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:30,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:09:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:30,701 INFO L87 Difference]: Start difference. First operand 26789 states and 89120 transitions. Second operand 3 states. [2019-12-27 04:09:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:30,843 INFO L93 Difference]: Finished difference Result 26164 states and 86696 transitions. [2019-12-27 04:09:30,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:09:30,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 04:09:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:30,883 INFO L225 Difference]: With dead ends: 26164 [2019-12-27 04:09:30,884 INFO L226 Difference]: Without dead ends: 26164 [2019-12-27 04:09:30,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26164 states. [2019-12-27 04:09:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26164 to 25648. [2019-12-27 04:09:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25648 states. [2019-12-27 04:09:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25648 states to 25648 states and 85220 transitions. [2019-12-27 04:09:31,419 INFO L78 Accepts]: Start accepts. Automaton has 25648 states and 85220 transitions. Word has length 69 [2019-12-27 04:09:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:31,419 INFO L462 AbstractCegarLoop]: Abstraction has 25648 states and 85220 transitions. [2019-12-27 04:09:31,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:09:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 25648 states and 85220 transitions. [2019-12-27 04:09:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 04:09:31,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:31,465 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] [2019-12-27 04:09:31,465 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -708151349, now seen corresponding path program 1 times [2019-12-27 04:09:31,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:31,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032912092] [2019-12-27 04:09:31,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:31,710 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 04:09:31,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032912092] [2019-12-27 04:09:31,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:31,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:09:31,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126702420] [2019-12-27 04:09:31,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:09:31,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:09:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:09:31,714 INFO L87 Difference]: Start difference. First operand 25648 states and 85220 transitions. Second operand 9 states. [2019-12-27 04:09:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:33,985 INFO L93 Difference]: Finished difference Result 34364 states and 111409 transitions. [2019-12-27 04:09:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:09:33,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-12-27 04:09:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:34,071 INFO L225 Difference]: With dead ends: 34364 [2019-12-27 04:09:34,072 INFO L226 Difference]: Without dead ends: 34364 [2019-12-27 04:09:34,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:09:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34364 states. [2019-12-27 04:09:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34364 to 21655. [2019-12-27 04:09:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21655 states. [2019-12-27 04:09:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21655 states to 21655 states and 70965 transitions. [2019-12-27 04:09:34,612 INFO L78 Accepts]: Start accepts. Automaton has 21655 states and 70965 transitions. Word has length 70 [2019-12-27 04:09:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:34,612 INFO L462 AbstractCegarLoop]: Abstraction has 21655 states and 70965 transitions. [2019-12-27 04:09:34,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:09:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21655 states and 70965 transitions. [2019-12-27 04:09:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 04:09:34,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:34,648 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] [2019-12-27 04:09:34,648 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 726610784, now seen corresponding path program 1 times [2019-12-27 04:09:34,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:34,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413550149] [2019-12-27 04:09:34,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:34,777 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 04:09:34,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413550149] [2019-12-27 04:09:34,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:34,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:09:34,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745363445] [2019-12-27 04:09:34,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:09:34,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:34,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:09:34,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:34,780 INFO L87 Difference]: Start difference. First operand 21655 states and 70965 transitions. Second operand 3 states. [2019-12-27 04:09:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:34,904 INFO L93 Difference]: Finished difference Result 21654 states and 70963 transitions. [2019-12-27 04:09:34,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:09:34,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-27 04:09:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:34,961 INFO L225 Difference]: With dead ends: 21654 [2019-12-27 04:09:34,961 INFO L226 Difference]: Without dead ends: 21654 [2019-12-27 04:09:34,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21654 states. [2019-12-27 04:09:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21654 to 21654. [2019-12-27 04:09:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21654 states. [2019-12-27 04:09:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21654 states to 21654 states and 70963 transitions. [2019-12-27 04:09:35,623 INFO L78 Accepts]: Start accepts. Automaton has 21654 states and 70963 transitions. Word has length 71 [2019-12-27 04:09:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:35,623 INFO L462 AbstractCegarLoop]: Abstraction has 21654 states and 70963 transitions. [2019-12-27 04:09:35,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:09:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21654 states and 70963 transitions. [2019-12-27 04:09:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:09:35,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:35,652 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] [2019-12-27 04:09:35,652 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1049534817, now seen corresponding path program 1 times [2019-12-27 04:09:35,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:35,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751910733] [2019-12-27 04:09:35,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:35,820 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 04:09:35,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751910733] [2019-12-27 04:09:35,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:35,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:09:35,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568565712] [2019-12-27 04:09:35,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:09:35,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:09:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:09:35,822 INFO L87 Difference]: Start difference. First operand 21654 states and 70963 transitions. Second operand 5 states. [2019-12-27 04:09:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:35,999 INFO L93 Difference]: Finished difference Result 27186 states and 87747 transitions. [2019-12-27 04:09:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:09:36,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-27 04:09:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:36,013 INFO L225 Difference]: With dead ends: 27186 [2019-12-27 04:09:36,013 INFO L226 Difference]: Without dead ends: 5993 [2019-12-27 04:09:36,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:09:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2019-12-27 04:09:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5993. [2019-12-27 04:09:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5993 states. [2019-12-27 04:09:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5993 states to 5993 states and 17855 transitions. [2019-12-27 04:09:36,170 INFO L78 Accepts]: Start accepts. Automaton has 5993 states and 17855 transitions. Word has length 72 [2019-12-27 04:09:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:36,170 INFO L462 AbstractCegarLoop]: Abstraction has 5993 states and 17855 transitions. [2019-12-27 04:09:36,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:09:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5993 states and 17855 transitions. [2019-12-27 04:09:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:09:36,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:36,180 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] [2019-12-27 04:09:36,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1176538835, now seen corresponding path program 2 times [2019-12-27 04:09:36,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:36,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894579783] [2019-12-27 04:09:36,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:36,651 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 04:09:36,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894579783] [2019-12-27 04:09:36,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:36,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 04:09:36,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368924852] [2019-12-27 04:09:36,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:09:36,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:09:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:09:36,654 INFO L87 Difference]: Start difference. First operand 5993 states and 17855 transitions. Second operand 18 states. [2019-12-27 04:09:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:39,197 INFO L93 Difference]: Finished difference Result 18171 states and 54344 transitions. [2019-12-27 04:09:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:09:39,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-27 04:09:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:39,212 INFO L225 Difference]: With dead ends: 18171 [2019-12-27 04:09:39,212 INFO L226 Difference]: Without dead ends: 10477 [2019-12-27 04:09:39,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:09:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2019-12-27 04:09:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 8495. [2019-12-27 04:09:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8495 states. [2019-12-27 04:09:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8495 states to 8495 states and 25001 transitions. [2019-12-27 04:09:39,351 INFO L78 Accepts]: Start accepts. Automaton has 8495 states and 25001 transitions. Word has length 72 [2019-12-27 04:09:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:39,351 INFO L462 AbstractCegarLoop]: Abstraction has 8495 states and 25001 transitions. [2019-12-27 04:09:39,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:09:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 8495 states and 25001 transitions. [2019-12-27 04:09:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:09:39,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:39,360 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] [2019-12-27 04:09:39,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash -631520119, now seen corresponding path program 3 times [2019-12-27 04:09:39,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:39,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775260665] [2019-12-27 04:09:39,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:39,940 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 04:09:39,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775260665] [2019-12-27 04:09:39,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:39,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 04:09:39,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676742073] [2019-12-27 04:09:39,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:09:39,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:39,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:09:39,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:09:39,942 INFO L87 Difference]: Start difference. First operand 8495 states and 25001 transitions. Second operand 20 states. [2019-12-27 04:09:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:41,765 INFO L93 Difference]: Finished difference Result 16652 states and 48883 transitions. [2019-12-27 04:09:41,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:09:41,765 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-27 04:09:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:41,787 INFO L225 Difference]: With dead ends: 16652 [2019-12-27 04:09:41,787 INFO L226 Difference]: Without dead ends: 15551 [2019-12-27 04:09:41,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:09:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15551 states. [2019-12-27 04:09:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15551 to 13198. [2019-12-27 04:09:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13198 states. [2019-12-27 04:09:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13198 states to 13198 states and 39027 transitions. [2019-12-27 04:09:42,004 INFO L78 Accepts]: Start accepts. Automaton has 13198 states and 39027 transitions. Word has length 72 [2019-12-27 04:09:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:42,004 INFO L462 AbstractCegarLoop]: Abstraction has 13198 states and 39027 transitions. [2019-12-27 04:09:42,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:09:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13198 states and 39027 transitions. [2019-12-27 04:09:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:09:42,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:42,019 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] [2019-12-27 04:09:42,019 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1388475171, now seen corresponding path program 1 times [2019-12-27 04:09:42,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:42,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331637389] [2019-12-27 04:09:42,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:42,071 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 04:09:42,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331637389] [2019-12-27 04:09:42,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:42,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:09:42,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117664104] [2019-12-27 04:09:42,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:09:42,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:42,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:09:42,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:42,073 INFO L87 Difference]: Start difference. First operand 13198 states and 39027 transitions. Second operand 3 states. [2019-12-27 04:09:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:42,194 INFO L93 Difference]: Finished difference Result 13217 states and 37565 transitions. [2019-12-27 04:09:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:09:42,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-27 04:09:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:42,217 INFO L225 Difference]: With dead ends: 13217 [2019-12-27 04:09:42,218 INFO L226 Difference]: Without dead ends: 12961 [2019-12-27 04:09:42,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:09:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2019-12-27 04:09:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12003. [2019-12-27 04:09:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12003 states. [2019-12-27 04:09:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12003 states to 12003 states and 34390 transitions. [2019-12-27 04:09:42,442 INFO L78 Accepts]: Start accepts. Automaton has 12003 states and 34390 transitions. Word has length 72 [2019-12-27 04:09:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:42,443 INFO L462 AbstractCegarLoop]: Abstraction has 12003 states and 34390 transitions. [2019-12-27 04:09:42,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:09:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 12003 states and 34390 transitions. [2019-12-27 04:09:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:09:42,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:42,461 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] [2019-12-27 04:09:42,461 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash -162566405, now seen corresponding path program 4 times [2019-12-27 04:09:42,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:42,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137515556] [2019-12-27 04:09:42,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:43,315 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 04:09:43,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137515556] [2019-12-27 04:09:43,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:43,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 04:09:43,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331629592] [2019-12-27 04:09:43,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:09:43,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:43,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:09:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:09:43,318 INFO L87 Difference]: Start difference. First operand 12003 states and 34390 transitions. Second operand 24 states. [2019-12-27 04:09:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:09:46,170 INFO L93 Difference]: Finished difference Result 23560 states and 67403 transitions. [2019-12-27 04:09:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 04:09:46,170 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-27 04:09:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:09:46,199 INFO L225 Difference]: With dead ends: 23560 [2019-12-27 04:09:46,199 INFO L226 Difference]: Without dead ends: 21190 [2019-12-27 04:09:46,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=1743, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 04:09:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21190 states. [2019-12-27 04:09:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21190 to 16143. [2019-12-27 04:09:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16143 states. [2019-12-27 04:09:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16143 states to 16143 states and 46857 transitions. [2019-12-27 04:09:46,937 INFO L78 Accepts]: Start accepts. Automaton has 16143 states and 46857 transitions. Word has length 72 [2019-12-27 04:09:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:09:46,938 INFO L462 AbstractCegarLoop]: Abstraction has 16143 states and 46857 transitions. [2019-12-27 04:09:46,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:09:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 16143 states and 46857 transitions. [2019-12-27 04:09:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:09:46,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:09:46,953 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] [2019-12-27 04:09:46,954 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:09:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:09:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash -189479241, now seen corresponding path program 5 times [2019-12-27 04:09:46,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:09:46,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145329728] [2019-12-27 04:09:46,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:09:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:09:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:09:48,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145329728] [2019-12-27 04:09:48,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:09:48,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-27 04:09:48,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446927663] [2019-12-27 04:09:48,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 04:09:48,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:09:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 04:09:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:09:48,712 INFO L87 Difference]: Start difference. First operand 16143 states and 46857 transitions. Second operand 26 states. [2019-12-27 04:09:50,814 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-12-27 04:09:52,251 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-27 04:09:59,640 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 04:10:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:00,559 INFO L93 Difference]: Finished difference Result 25591 states and 72878 transitions. [2019-12-27 04:10:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 04:10:00,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-27 04:10:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:00,590 INFO L225 Difference]: With dead ends: 25591 [2019-12-27 04:10:00,590 INFO L226 Difference]: Without dead ends: 24335 [2019-12-27 04:10:00,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=762, Invalid=7070, Unknown=0, NotChecked=0, Total=7832 [2019-12-27 04:10:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24335 states. [2019-12-27 04:10:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24335 to 17103. [2019-12-27 04:10:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17103 states. [2019-12-27 04:10:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17103 states to 17103 states and 49524 transitions. [2019-12-27 04:10:00,887 INFO L78 Accepts]: Start accepts. Automaton has 17103 states and 49524 transitions. Word has length 72 [2019-12-27 04:10:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:00,888 INFO L462 AbstractCegarLoop]: Abstraction has 17103 states and 49524 transitions. [2019-12-27 04:10:00,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 04:10:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 17103 states and 49524 transitions. [2019-12-27 04:10:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:00,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:00,905 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] [2019-12-27 04:10:00,905 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:00,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash 460354895, now seen corresponding path program 6 times [2019-12-27 04:10:00,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:00,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947040481] [2019-12-27 04:10:00,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:01,675 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 04:10:01,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947040481] [2019-12-27 04:10:01,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:01,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 04:10:01,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77268390] [2019-12-27 04:10:01,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:10:01,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:10:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:10:01,677 INFO L87 Difference]: Start difference. First operand 17103 states and 49524 transitions. Second operand 24 states. [2019-12-27 04:10:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:04,251 INFO L93 Difference]: Finished difference Result 24630 states and 70337 transitions. [2019-12-27 04:10:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 04:10:04,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-27 04:10:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:04,283 INFO L225 Difference]: With dead ends: 24630 [2019-12-27 04:10:04,283 INFO L226 Difference]: Without dead ends: 24538 [2019-12-27 04:10:04,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=299, Invalid=2053, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 04:10:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24538 states. [2019-12-27 04:10:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24538 to 17847. [2019-12-27 04:10:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17847 states. [2019-12-27 04:10:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17847 states to 17847 states and 51606 transitions. [2019-12-27 04:10:04,596 INFO L78 Accepts]: Start accepts. Automaton has 17847 states and 51606 transitions. Word has length 72 [2019-12-27 04:10:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:04,596 INFO L462 AbstractCegarLoop]: Abstraction has 17847 states and 51606 transitions. [2019-12-27 04:10:04,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:10:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17847 states and 51606 transitions. [2019-12-27 04:10:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:04,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:04,622 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] [2019-12-27 04:10:04,623 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1980437955, now seen corresponding path program 7 times [2019-12-27 04:10:04,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:04,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98084092] [2019-12-27 04:10:04,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:05,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98084092] [2019-12-27 04:10:05,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:05,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 04:10:05,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038532603] [2019-12-27 04:10:05,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:10:05,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:10:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:10:05,389 INFO L87 Difference]: Start difference. First operand 17847 states and 51606 transitions. Second operand 24 states. [2019-12-27 04:10:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:08,305 INFO L93 Difference]: Finished difference Result 24567 states and 70150 transitions. [2019-12-27 04:10:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 04:10:08,306 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-27 04:10:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:08,337 INFO L225 Difference]: With dead ends: 24567 [2019-12-27 04:10:08,337 INFO L226 Difference]: Without dead ends: 24479 [2019-12-27 04:10:08,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 04:10:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24479 states. [2019-12-27 04:10:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24479 to 17703. [2019-12-27 04:10:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17703 states. [2019-12-27 04:10:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17703 states to 17703 states and 51199 transitions. [2019-12-27 04:10:08,634 INFO L78 Accepts]: Start accepts. Automaton has 17703 states and 51199 transitions. Word has length 72 [2019-12-27 04:10:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:08,634 INFO L462 AbstractCegarLoop]: Abstraction has 17703 states and 51199 transitions. [2019-12-27 04:10:08,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:10:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 17703 states and 51199 transitions. [2019-12-27 04:10:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:08,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:08,653 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] [2019-12-27 04:10:08,653 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash 372494627, now seen corresponding path program 8 times [2019-12-27 04:10:08,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:08,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967774913] [2019-12-27 04:10:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:09,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967774913] [2019-12-27 04:10:09,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:09,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 04:10:09,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129431543] [2019-12-27 04:10:09,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:10:09,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:09,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:10:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:10:09,354 INFO L87 Difference]: Start difference. First operand 17703 states and 51199 transitions. Second operand 24 states. [2019-12-27 04:10:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:12,070 INFO L93 Difference]: Finished difference Result 24414 states and 69727 transitions. [2019-12-27 04:10:12,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 04:10:12,071 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-27 04:10:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:12,100 INFO L225 Difference]: With dead ends: 24414 [2019-12-27 04:10:12,100 INFO L226 Difference]: Without dead ends: 24314 [2019-12-27 04:10:12,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=305, Invalid=2145, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 04:10:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24314 states. [2019-12-27 04:10:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24314 to 17639. [2019-12-27 04:10:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17639 states. [2019-12-27 04:10:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17639 states to 17639 states and 51015 transitions. [2019-12-27 04:10:12,394 INFO L78 Accepts]: Start accepts. Automaton has 17639 states and 51015 transitions. Word has length 72 [2019-12-27 04:10:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:12,394 INFO L462 AbstractCegarLoop]: Abstraction has 17639 states and 51015 transitions. [2019-12-27 04:10:12,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:10:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 17639 states and 51015 transitions. [2019-12-27 04:10:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:12,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:12,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:12,413 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1361954245, now seen corresponding path program 9 times [2019-12-27 04:10:12,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:12,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048122912] [2019-12-27 04:10:12,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:13,578 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 04:10:13,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048122912] [2019-12-27 04:10:13,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:13,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 04:10:13,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707529585] [2019-12-27 04:10:13,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:10:13,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:10:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:10:13,580 INFO L87 Difference]: Start difference. First operand 17639 states and 51015 transitions. Second operand 24 states. [2019-12-27 04:10:15,505 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-27 04:10:15,824 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-12-27 04:10:16,105 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-27 04:10:16,251 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-27 04:10:17,437 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 04:10:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:19,532 INFO L93 Difference]: Finished difference Result 24891 states and 71096 transitions. [2019-12-27 04:10:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 04:10:19,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-27 04:10:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:19,564 INFO L225 Difference]: With dead ends: 24891 [2019-12-27 04:10:19,564 INFO L226 Difference]: Without dead ends: 24351 [2019-12-27 04:10:19,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=483, Invalid=3939, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 04:10:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24351 states. [2019-12-27 04:10:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24351 to 17191. [2019-12-27 04:10:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17191 states. [2019-12-27 04:10:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17191 states to 17191 states and 49783 transitions. [2019-12-27 04:10:19,859 INFO L78 Accepts]: Start accepts. Automaton has 17191 states and 49783 transitions. Word has length 72 [2019-12-27 04:10:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:19,859 INFO L462 AbstractCegarLoop]: Abstraction has 17191 states and 49783 transitions. [2019-12-27 04:10:19,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:10:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17191 states and 49783 transitions. [2019-12-27 04:10:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:19,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:19,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:19,881 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:19,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:19,881 INFO L82 PathProgramCache]: Analyzing trace with hash 310243399, now seen corresponding path program 10 times [2019-12-27 04:10:19,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:19,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302454420] [2019-12-27 04:10:19,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:20,657 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 04:10:20,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302454420] [2019-12-27 04:10:20,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:20,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 04:10:20,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494405634] [2019-12-27 04:10:20,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:10:20,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:10:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:10:20,659 INFO L87 Difference]: Start difference. First operand 17191 states and 49783 transitions. Second operand 23 states. [2019-12-27 04:10:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:24,016 INFO L93 Difference]: Finished difference Result 30800 states and 88811 transitions. [2019-12-27 04:10:24,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 04:10:24,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-27 04:10:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:24,202 INFO L225 Difference]: With dead ends: 30800 [2019-12-27 04:10:24,202 INFO L226 Difference]: Without dead ends: 30620 [2019-12-27 04:10:24,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=298, Invalid=2252, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 04:10:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30620 states. [2019-12-27 04:10:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30620 to 21742. [2019-12-27 04:10:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21742 states. [2019-12-27 04:10:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21742 states to 21742 states and 63551 transitions. [2019-12-27 04:10:24,565 INFO L78 Accepts]: Start accepts. Automaton has 21742 states and 63551 transitions. Word has length 72 [2019-12-27 04:10:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:24,566 INFO L462 AbstractCegarLoop]: Abstraction has 21742 states and 63551 transitions. [2019-12-27 04:10:24,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:10:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21742 states and 63551 transitions. [2019-12-27 04:10:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:24,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:24,592 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] [2019-12-27 04:10:24,592 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:24,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2130549451, now seen corresponding path program 11 times [2019-12-27 04:10:24,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:24,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038956787] [2019-12-27 04:10:24,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:25,310 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 04:10:25,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038956787] [2019-12-27 04:10:25,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:25,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 04:10:25,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431243794] [2019-12-27 04:10:25,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:10:25,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:10:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:10:25,312 INFO L87 Difference]: Start difference. First operand 21742 states and 63551 transitions. Second operand 23 states. [2019-12-27 04:10:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:28,499 INFO L93 Difference]: Finished difference Result 30559 states and 88182 transitions. [2019-12-27 04:10:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 04:10:28,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-27 04:10:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:28,542 INFO L225 Difference]: With dead ends: 30559 [2019-12-27 04:10:28,542 INFO L226 Difference]: Without dead ends: 30387 [2019-12-27 04:10:28,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=313, Invalid=2443, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 04:10:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30387 states. [2019-12-27 04:10:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30387 to 20962. [2019-12-27 04:10:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20962 states. [2019-12-27 04:10:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20962 states to 20962 states and 61233 transitions. [2019-12-27 04:10:28,909 INFO L78 Accepts]: Start accepts. Automaton has 20962 states and 61233 transitions. Word has length 72 [2019-12-27 04:10:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:28,909 INFO L462 AbstractCegarLoop]: Abstraction has 20962 states and 61233 transitions. [2019-12-27 04:10:28,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:10:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20962 states and 61233 transitions. [2019-12-27 04:10:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:28,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:28,931 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] [2019-12-27 04:10:28,931 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash 222383131, now seen corresponding path program 12 times [2019-12-27 04:10:28,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:28,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971918882] [2019-12-27 04:10:28,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:30,499 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 04:10:30,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971918882] [2019-12-27 04:10:30,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:30,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-27 04:10:30,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95654663] [2019-12-27 04:10:30,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 04:10:30,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:30,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 04:10:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:10:30,501 INFO L87 Difference]: Start difference. First operand 20962 states and 61233 transitions. Second operand 28 states. [2019-12-27 04:10:31,606 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-12-27 04:10:32,484 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 04:10:33,666 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-12-27 04:10:34,564 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-27 04:10:34,698 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 04:10:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:41,119 INFO L93 Difference]: Finished difference Result 28652 states and 82364 transitions. [2019-12-27 04:10:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 04:10:41,120 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2019-12-27 04:10:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:41,156 INFO L225 Difference]: With dead ends: 28652 [2019-12-27 04:10:41,157 INFO L226 Difference]: Without dead ends: 28048 [2019-12-27 04:10:41,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2152 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=834, Invalid=7176, Unknown=0, NotChecked=0, Total=8010 [2019-12-27 04:10:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28048 states. [2019-12-27 04:10:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28048 to 21350. [2019-12-27 04:10:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2019-12-27 04:10:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62299 transitions. [2019-12-27 04:10:41,503 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62299 transitions. Word has length 72 [2019-12-27 04:10:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:41,503 INFO L462 AbstractCegarLoop]: Abstraction has 21350 states and 62299 transitions. [2019-12-27 04:10:41,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 04:10:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62299 transitions. [2019-12-27 04:10:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:41,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:41,525 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] [2019-12-27 04:10:41,525 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1822414919, now seen corresponding path program 13 times [2019-12-27 04:10:41,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:41,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561416175] [2019-12-27 04:10:41,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:42,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561416175] [2019-12-27 04:10:42,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:42,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-27 04:10:42,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289238732] [2019-12-27 04:10:42,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 04:10:42,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 04:10:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:10:42,498 INFO L87 Difference]: Start difference. First operand 21350 states and 62299 transitions. Second operand 25 states. [2019-12-27 04:10:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:45,713 INFO L93 Difference]: Finished difference Result 29410 states and 84245 transitions. [2019-12-27 04:10:45,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 04:10:45,713 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-12-27 04:10:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:45,752 INFO L225 Difference]: With dead ends: 29410 [2019-12-27 04:10:45,752 INFO L226 Difference]: Without dead ends: 28606 [2019-12-27 04:10:45,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=352, Invalid=2618, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 04:10:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28606 states. [2019-12-27 04:10:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28606 to 21230. [2019-12-27 04:10:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21230 states. [2019-12-27 04:10:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21230 states to 21230 states and 62050 transitions. [2019-12-27 04:10:46,113 INFO L78 Accepts]: Start accepts. Automaton has 21230 states and 62050 transitions. Word has length 72 [2019-12-27 04:10:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:46,113 INFO L462 AbstractCegarLoop]: Abstraction has 21230 states and 62050 transitions. [2019-12-27 04:10:46,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 04:10:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 21230 states and 62050 transitions. [2019-12-27 04:10:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:46,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:46,134 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] [2019-12-27 04:10:46,134 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash 182743917, now seen corresponding path program 14 times [2019-12-27 04:10:46,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:46,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159081501] [2019-12-27 04:10:46,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:47,165 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 04:10:47,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159081501] [2019-12-27 04:10:47,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:47,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-27 04:10:47,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314997483] [2019-12-27 04:10:47,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 04:10:47,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 04:10:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:10:47,168 INFO L87 Difference]: Start difference. First operand 21230 states and 62050 transitions. Second operand 26 states. [2019-12-27 04:10:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:50,610 INFO L93 Difference]: Finished difference Result 28362 states and 81365 transitions. [2019-12-27 04:10:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 04:10:50,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-27 04:10:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:50,648 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 04:10:50,648 INFO L226 Difference]: Without dead ends: 28014 [2019-12-27 04:10:50,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=363, Invalid=2829, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 04:10:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-27 04:10:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 20706. [2019-12-27 04:10:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20706 states. [2019-12-27 04:10:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20706 states to 20706 states and 60519 transitions. [2019-12-27 04:10:51,145 INFO L78 Accepts]: Start accepts. Automaton has 20706 states and 60519 transitions. Word has length 72 [2019-12-27 04:10:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:51,145 INFO L462 AbstractCegarLoop]: Abstraction has 20706 states and 60519 transitions. [2019-12-27 04:10:51,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 04:10:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 20706 states and 60519 transitions. [2019-12-27 04:10:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:51,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:51,165 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] [2019-12-27 04:10:51,166 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1997538195, now seen corresponding path program 15 times [2019-12-27 04:10:51,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:51,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042760703] [2019-12-27 04:10:51,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:51,717 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 04:10:51,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042760703] [2019-12-27 04:10:51,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:51,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 04:10:51,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329834619] [2019-12-27 04:10:51,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 04:10:51,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:51,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 04:10:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:10:51,719 INFO L87 Difference]: Start difference. First operand 20706 states and 60519 transitions. Second operand 21 states. [2019-12-27 04:10:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:54,357 INFO L93 Difference]: Finished difference Result 37273 states and 108816 transitions. [2019-12-27 04:10:54,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 04:10:54,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-12-27 04:10:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:54,404 INFO L225 Difference]: With dead ends: 37273 [2019-12-27 04:10:54,404 INFO L226 Difference]: Without dead ends: 34532 [2019-12-27 04:10:54,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=317, Invalid=1939, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 04:10:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34532 states. [2019-12-27 04:10:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34532 to 21874. [2019-12-27 04:10:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21874 states. [2019-12-27 04:10:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21874 states to 21874 states and 63893 transitions. [2019-12-27 04:10:54,817 INFO L78 Accepts]: Start accepts. Automaton has 21874 states and 63893 transitions. Word has length 72 [2019-12-27 04:10:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:54,817 INFO L462 AbstractCegarLoop]: Abstraction has 21874 states and 63893 transitions. [2019-12-27 04:10:54,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 04:10:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21874 states and 63893 transitions. [2019-12-27 04:10:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:10:54,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:54,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:54,840 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1528584481, now seen corresponding path program 16 times [2019-12-27 04:10:54,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:54,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755523962] [2019-12-27 04:10:54,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:55,944 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 04:10:55,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755523962] [2019-12-27 04:10:55,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:55,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-27 04:10:55,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082699942] [2019-12-27 04:10:55,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 04:10:55,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 04:10:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:10:55,946 INFO L87 Difference]: Start difference. First operand 21874 states and 63893 transitions. Second operand 25 states. [2019-12-27 04:11:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:04,690 INFO L93 Difference]: Finished difference Result 33704 states and 96239 transitions. [2019-12-27 04:11:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-27 04:11:04,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-12-27 04:11:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:04,731 INFO L225 Difference]: With dead ends: 33704 [2019-12-27 04:11:04,731 INFO L226 Difference]: Without dead ends: 31673 [2019-12-27 04:11:04,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2598 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=991, Invalid=8129, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 04:11:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31673 states. [2019-12-27 04:11:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31673 to 22976. [2019-12-27 04:11:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22976 states. [2019-12-27 04:11:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22976 states to 22976 states and 66903 transitions. [2019-12-27 04:11:05,130 INFO L78 Accepts]: Start accepts. Automaton has 22976 states and 66903 transitions. Word has length 72 [2019-12-27 04:11:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:05,130 INFO L462 AbstractCegarLoop]: Abstraction has 22976 states and 66903 transitions. [2019-12-27 04:11:05,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 04:11:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 22976 states and 66903 transitions. [2019-12-27 04:11:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:11:05,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:05,156 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] [2019-12-27 04:11:05,156 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1426626871, now seen corresponding path program 17 times [2019-12-27 04:11:05,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:05,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720560404] [2019-12-27 04:11:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:05,811 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 04:11:05,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720560404] [2019-12-27 04:11:05,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:05,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 04:11:05,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750100351] [2019-12-27 04:11:05,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:11:05,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:11:05,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:11:05,813 INFO L87 Difference]: Start difference. First operand 22976 states and 66903 transitions. Second operand 24 states. [2019-12-27 04:11:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:08,238 INFO L93 Difference]: Finished difference Result 30606 states and 88090 transitions. [2019-12-27 04:11:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 04:11:08,238 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-27 04:11:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:08,277 INFO L225 Difference]: With dead ends: 30606 [2019-12-27 04:11:08,277 INFO L226 Difference]: Without dead ends: 29762 [2019-12-27 04:11:08,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=1987, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 04:11:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29762 states. [2019-12-27 04:11:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29762 to 23072. [2019-12-27 04:11:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23072 states. [2019-12-27 04:11:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23072 states to 23072 states and 67171 transitions. [2019-12-27 04:11:08,853 INFO L78 Accepts]: Start accepts. Automaton has 23072 states and 67171 transitions. Word has length 72 [2019-12-27 04:11:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:08,853 INFO L462 AbstractCegarLoop]: Abstraction has 23072 states and 67171 transitions. [2019-12-27 04:11:08,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:11:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23072 states and 67171 transitions. [2019-12-27 04:11:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:11:08,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:08,879 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] [2019-12-27 04:11:08,879 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:08,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2076461007, now seen corresponding path program 18 times [2019-12-27 04:11:08,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:08,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157498706] [2019-12-27 04:11:08,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:10,362 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 04:11:10,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157498706] [2019-12-27 04:11:10,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:10,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-27 04:11:10,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737967043] [2019-12-27 04:11:10,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 04:11:10,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 04:11:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:11:10,364 INFO L87 Difference]: Start difference. First operand 23072 states and 67171 transitions. Second operand 26 states. [2019-12-27 04:11:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:18,726 INFO L93 Difference]: Finished difference Result 47932 states and 139500 transitions. [2019-12-27 04:11:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 04:11:18,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-27 04:11:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:18,788 INFO L225 Difference]: With dead ends: 47932 [2019-12-27 04:11:18,788 INFO L226 Difference]: Without dead ends: 46736 [2019-12-27 04:11:18,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2492 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1162, Invalid=7394, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 04:11:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46736 states. [2019-12-27 04:11:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46736 to 28001. [2019-12-27 04:11:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28001 states. [2019-12-27 04:11:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28001 states to 28001 states and 81825 transitions. [2019-12-27 04:11:19,526 INFO L78 Accepts]: Start accepts. Automaton has 28001 states and 81825 transitions. Word has length 72 [2019-12-27 04:11:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:19,527 INFO L462 AbstractCegarLoop]: Abstraction has 28001 states and 81825 transitions. [2019-12-27 04:11:19,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 04:11:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28001 states and 81825 transitions. [2019-12-27 04:11:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 04:11:19,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:19,554 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] [2019-12-27 04:11:19,554 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1316906939, now seen corresponding path program 19 times [2019-12-27 04:11:19,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:19,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060559093] [2019-12-27 04:11:19,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:20,260 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 04:11:20,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060559093] [2019-12-27 04:11:20,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:20,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 04:11:20,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099088037] [2019-12-27 04:11:20,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:11:20,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:11:20,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:11:20,262 INFO L87 Difference]: Start difference. First operand 28001 states and 81825 transitions. Second operand 19 states. [2019-12-27 04:11:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:24,776 INFO L93 Difference]: Finished difference Result 49746 states and 144378 transitions. [2019-12-27 04:11:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 04:11:24,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-27 04:11:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:24,825 INFO L225 Difference]: With dead ends: 49746 [2019-12-27 04:11:24,826 INFO L226 Difference]: Without dead ends: 34377 [2019-12-27 04:11:24,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=421, Invalid=2335, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 04:11:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34377 states. Received shutdown request... [2019-12-27 04:11:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34377 to 29992. [2019-12-27 04:11:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29992 states. [2019-12-27 04:11:25,265 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 04:11:25,269 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 04:11:25,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:11:25 BasicIcfg [2019-12-27 04:11:25,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:11:25,270 INFO L168 Benchmark]: Toolchain (without parser) took 234902.06 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,271 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.34 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 156.3 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.00 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,272 INFO L168 Benchmark]: Boogie Preprocessor took 46.82 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 150.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,273 INFO L168 Benchmark]: RCFGBuilder took 1192.05 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 150.5 MB in the beginning and 198.8 MB in the end (delta: -48.4 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,274 INFO L168 Benchmark]: TraceAbstraction took 232724.38 ms. Allocated memory was 235.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 198.8 MB in the beginning and 1.2 GB in the end (delta: -972.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 04:11:25,276 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.40 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 872.34 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 156.3 MB in the end (delta: -54.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.00 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.82 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 150.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1192.05 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 150.5 MB in the beginning and 198.8 MB in the end (delta: -48.4 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232724.38 ms. Allocated memory was 235.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 198.8 MB in the beginning and 1.2 GB in the end (delta: -972.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 223 ProgramPointsBefore, 117 ProgramPointsAfterwards, 276 TransitionsBefore, 138 TransitionsAfterwards, 32976 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 62 ConcurrentYvCompositions, 36 ChoiceCompositions, 12209 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 347 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 183707 CheckedPairsTotal, 146 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). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 214 locations, 1 error locations. Result: TIMEOUT, OverallTime: 232.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 90.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6996 SDtfs, 14349 SDslu, 76353 SDs, 0 SdLazy, 49231 SolverSat, 1904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1200 GetRequests, 70 SyntacticMatches, 43 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17346 ImplicationChecksByTransitivity, 46.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300418occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 145590 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 1868984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown