/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/mix056_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:00:32,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:00:32,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:00:32,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:00:32,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:00:32,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:00:32,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:00:32,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:00:32,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:00:32,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:00:32,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:00:32,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:00:32,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:00:32,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:00:32,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:00:32,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:00:32,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:00:32,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:00:32,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:00:32,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:00:32,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:00:32,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:00:32,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:00:32,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:00:32,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:00:32,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:00:32,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:00:32,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:00:32,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:00:32,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:00:32,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:00:32,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:00:32,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:00:32,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:00:32,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:00:32,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:00:32,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:00:32,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:00:32,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:00:32,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:00:32,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:00:32,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:00:32,069 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:00:32,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:00:32,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:00:32,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:00:32,071 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:00:32,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:00:32,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:00:32,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:00:32,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:00:32,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:00:32,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:00:32,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:00:32,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:00:32,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:00:32,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:00:32,073 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:00:32,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:00:32,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:00:32,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:00:32,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:00:32,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:00:32,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:00:32,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:00:32,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:00:32,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:00:32,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:00:32,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:00:32,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:00:32,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:00:32,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:00:32,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:00:32,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:00:32,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:00:32,395 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:00:32,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2019-12-27 03:00:32,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a69211a/aba75eb8036d4d6fb25e44b4c367a220/FLAG20e0348b6 [2019-12-27 03:00:33,012 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:00:33,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2019-12-27 03:00:33,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a69211a/aba75eb8036d4d6fb25e44b4c367a220/FLAG20e0348b6 [2019-12-27 03:00:33,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a69211a/aba75eb8036d4d6fb25e44b4c367a220 [2019-12-27 03:00:33,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:00:33,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:00:33,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:00:33,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:00:33,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:00:33,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:00:33" (1/1) ... [2019-12-27 03:00:33,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:33, skipping insertion in model container [2019-12-27 03:00:33,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:00:33" (1/1) ... [2019-12-27 03:00:33,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:00:33,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:00:33,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:00:33,935 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:00:34,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:00:34,105 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:00:34,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34 WrapperNode [2019-12-27 03:00:34,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:00:34,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:00:34,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:00:34,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:00:34,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:00:34,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:00:34,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:00:34,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:00:34,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... [2019-12-27 03:00:34,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:00:34,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:00:34,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:00:34,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:00:34,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:00:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:00:34,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:00:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:00:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:00:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:00:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:00:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:00:34,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:00:34,288 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:00:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:00:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:00:34,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:00:34,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:00:34,291 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:00:35,079 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:00:35,080 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:00:35,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:00:35 BoogieIcfgContainer [2019-12-27 03:00:35,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:00:35,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:00:35,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:00:35,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:00:35,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:00:33" (1/3) ... [2019-12-27 03:00:35,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7653828c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:00:35, skipping insertion in model container [2019-12-27 03:00:35,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:00:34" (2/3) ... [2019-12-27 03:00:35,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7653828c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:00:35, skipping insertion in model container [2019-12-27 03:00:35,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:00:35" (3/3) ... [2019-12-27 03:00:35,090 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_rmo.oepc.i [2019-12-27 03:00:35,101 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:00:35,102 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:00:35,110 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:00:35,111 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:00:35,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,170 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,288 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:00:35,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:00:35,330 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:00:35,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:00:35,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:00:35,331 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:00:35,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:00:35,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:00:35,331 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:00:35,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:00:35,347 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 03:00:35,349 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:00:35,479 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:00:35,479 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:00:35,498 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:00:35,519 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:00:35,584 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:00:35,584 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:00:35,592 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:00:35,614 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 03:00:35,615 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:00:42,176 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:00:42,350 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:00:42,380 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-27 03:00:42,380 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 03:00:42,384 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 03:00:56,760 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 03:00:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 03:00:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:00:56,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:56,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:00:56,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-27 03:00:56,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:56,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320543809] [2019-12-27 03:00:56,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:57,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320543809] [2019-12-27 03:00:57,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:57,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:00:57,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069028860] [2019-12-27 03:00:57,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:57,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:57,065 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 03:01:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:01,050 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-27 03:01:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:01,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:01:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:01,657 INFO L225 Difference]: With dead ends: 101472 [2019-12-27 03:01:01,657 INFO L226 Difference]: Without dead ends: 95232 [2019-12-27 03:01:01,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-27 03:01:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-27 03:01:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-27 03:01:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-27 03:01:08,230 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-27 03:01:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:08,230 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-27 03:01:08,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-27 03:01:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:01:08,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:08,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:08,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-27 03:01:08,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:08,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865593261] [2019-12-27 03:01:08,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:08,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865593261] [2019-12-27 03:01:08,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:08,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:08,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304557464] [2019-12-27 03:01:08,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:01:08,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:01:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:08,349 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-27 03:01:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:13,653 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-27 03:01:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:13,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:01:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:14,088 INFO L225 Difference]: With dead ends: 151692 [2019-12-27 03:01:14,089 INFO L226 Difference]: Without dead ends: 151643 [2019-12-27 03:01:14,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-27 03:01:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-27 03:01:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-27 03:01:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-27 03:01:24,853 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-27 03:01:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:24,853 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-27 03:01:24,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:01:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-27 03:01:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:01:24,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:24,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:24,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-27 03:01:24,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:24,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607254616] [2019-12-27 03:01:24,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:24,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607254616] [2019-12-27 03:01:24,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:24,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:24,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811194736] [2019-12-27 03:01:24,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:24,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:24,921 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-27 03:01:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:25,044 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-27 03:01:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:25,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:01:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:25,158 INFO L225 Difference]: With dead ends: 30955 [2019-12-27 03:01:25,158 INFO L226 Difference]: Without dead ends: 30955 [2019-12-27 03:01:25,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-27 03:01:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-27 03:01:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-27 03:01:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-27 03:01:29,719 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-27 03:01:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:29,719 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-27 03:01:29,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-27 03:01:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:01:29,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:29,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:29,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-27 03:01:29,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:29,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940276787] [2019-12-27 03:01:29,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:29,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940276787] [2019-12-27 03:01:29,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:29,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:29,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235300927] [2019-12-27 03:01:29,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:29,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:29,804 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-27 03:01:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:29,980 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-27 03:01:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:29,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:01:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:30,094 INFO L225 Difference]: With dead ends: 47061 [2019-12-27 03:01:30,094 INFO L226 Difference]: Without dead ends: 47061 [2019-12-27 03:01:30,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-27 03:01:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-27 03:01:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-27 03:01:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-27 03:01:30,778 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-27 03:01:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:30,779 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-27 03:01:30,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-27 03:01:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:01:30,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:30,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:30,782 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-27 03:01:30,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:30,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90112962] [2019-12-27 03:01:30,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:30,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90112962] [2019-12-27 03:01:30,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:30,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:30,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719661691] [2019-12-27 03:01:30,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:01:30,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:01:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:30,856 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-27 03:01:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:31,232 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-27 03:01:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:31,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 03:01:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:31,319 INFO L225 Difference]: With dead ends: 41000 [2019-12-27 03:01:31,319 INFO L226 Difference]: Without dead ends: 41000 [2019-12-27 03:01:31,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-27 03:01:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-27 03:01:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-27 03:01:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-27 03:01:32,401 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-27 03:01:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:32,401 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-27 03:01:32,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:01:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-27 03:01:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:01:32,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:32,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:32,403 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-27 03:01:32,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:32,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466964475] [2019-12-27 03:01:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:32,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466964475] [2019-12-27 03:01:32,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:32,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:32,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504402309] [2019-12-27 03:01:32,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:01:32,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:01:32,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:32,471 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-27 03:01:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:32,814 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-27 03:01:32,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:32,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 03:01:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:32,887 INFO L225 Difference]: With dead ends: 45062 [2019-12-27 03:01:32,887 INFO L226 Difference]: Without dead ends: 45062 [2019-12-27 03:01:32,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-27 03:01:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-27 03:01:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-27 03:01:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-27 03:01:33,577 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-27 03:01:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:33,578 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-27 03:01:33,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:01:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-27 03:01:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:01:33,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:33,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:33,589 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-27 03:01:33,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:33,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673638043] [2019-12-27 03:01:33,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:33,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673638043] [2019-12-27 03:01:33,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:33,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:33,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063704900] [2019-12-27 03:01:33,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:33,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:33,682 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-27 03:01:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:34,656 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-27 03:01:34,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:01:34,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:01:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:34,744 INFO L225 Difference]: With dead ends: 53898 [2019-12-27 03:01:34,745 INFO L226 Difference]: Without dead ends: 53891 [2019-12-27 03:01:34,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-27 03:01:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-27 03:01:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-27 03:01:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-27 03:01:35,497 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-27 03:01:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:35,498 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-27 03:01:35,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-27 03:01:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:01:35,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:35,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:35,507 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-27 03:01:35,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:35,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006688484] [2019-12-27 03:01:35,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:35,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006688484] [2019-12-27 03:01:35,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:35,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:35,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909672623] [2019-12-27 03:01:35,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:35,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:35,610 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-27 03:01:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:36,231 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-27 03:01:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:01:36,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:01:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:36,321 INFO L225 Difference]: With dead ends: 56181 [2019-12-27 03:01:36,321 INFO L226 Difference]: Without dead ends: 56174 [2019-12-27 03:01:36,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-27 03:01:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-27 03:01:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-27 03:01:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-27 03:01:37,571 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-27 03:01:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:37,572 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-27 03:01:37,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-27 03:01:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:01:37,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:37,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:37,583 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-27 03:01:37,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:37,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483360684] [2019-12-27 03:01:37,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:37,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483360684] [2019-12-27 03:01:37,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:37,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:37,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034165142] [2019-12-27 03:01:37,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:01:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:01:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:37,641 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-27 03:01:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:37,717 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-27 03:01:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:01:37,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:01:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:37,746 INFO L225 Difference]: With dead ends: 15260 [2019-12-27 03:01:37,746 INFO L226 Difference]: Without dead ends: 15260 [2019-12-27 03:01:37,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:01:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-27 03:01:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-27 03:01:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-27 03:01:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-27 03:01:37,983 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-27 03:01:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:37,983 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-27 03:01:37,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:01:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-27 03:01:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:01:37,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:37,996 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 03:01:37,996 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-27 03:01:37,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:37,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949737334] [2019-12-27 03:01:37,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:38,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949737334] [2019-12-27 03:01:38,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:38,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:38,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533297528] [2019-12-27 03:01:38,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:38,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:38,069 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-27 03:01:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:38,465 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-27 03:01:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:01:38,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 03:01:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:38,511 INFO L225 Difference]: With dead ends: 19496 [2019-12-27 03:01:38,511 INFO L226 Difference]: Without dead ends: 19496 [2019-12-27 03:01:38,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-27 03:01:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-27 03:01:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-27 03:01:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-27 03:01:38,894 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-27 03:01:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:38,894 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-27 03:01:38,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-27 03:01:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:01:38,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:38,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:38,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:38,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-27 03:01:38,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:38,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756129062] [2019-12-27 03:01:38,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:38,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756129062] [2019-12-27 03:01:38,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:38,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:38,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169471113] [2019-12-27 03:01:38,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:38,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:38,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:38,968 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-27 03:01:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:39,354 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-27 03:01:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:01:39,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:01:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:39,395 INFO L225 Difference]: With dead ends: 21384 [2019-12-27 03:01:39,395 INFO L226 Difference]: Without dead ends: 21384 [2019-12-27 03:01:39,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-27 03:01:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-27 03:01:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-27 03:01:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-27 03:01:39,698 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-27 03:01:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:39,699 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-27 03:01:39,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-27 03:01:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:01:39,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:39,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:39,716 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-27 03:01:39,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:39,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611349938] [2019-12-27 03:01:39,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:39,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611349938] [2019-12-27 03:01:39,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:39,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:39,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354009601] [2019-12-27 03:01:39,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:01:39,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:01:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:39,883 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 7 states. [2019-12-27 03:01:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:40,784 INFO L93 Difference]: Finished difference Result 25126 states and 74494 transitions. [2019-12-27 03:01:40,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:01:40,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 03:01:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:40,819 INFO L225 Difference]: With dead ends: 25126 [2019-12-27 03:01:40,820 INFO L226 Difference]: Without dead ends: 25126 [2019-12-27 03:01:40,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:01:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25126 states. [2019-12-27 03:01:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25126 to 18107. [2019-12-27 03:01:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18107 states. [2019-12-27 03:01:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18107 states to 18107 states and 55159 transitions. [2019-12-27 03:01:41,371 INFO L78 Accepts]: Start accepts. Automaton has 18107 states and 55159 transitions. Word has length 33 [2019-12-27 03:01:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:41,371 INFO L462 AbstractCegarLoop]: Abstraction has 18107 states and 55159 transitions. [2019-12-27 03:01:41,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:01:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 18107 states and 55159 transitions. [2019-12-27 03:01:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:01:41,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:41,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:41,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1137221687, now seen corresponding path program 2 times [2019-12-27 03:01:41,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:41,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290406253] [2019-12-27 03:01:41,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:41,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290406253] [2019-12-27 03:01:41,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:41,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:01:41,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926351736] [2019-12-27 03:01:41,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:01:41,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:01:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:41,460 INFO L87 Difference]: Start difference. First operand 18107 states and 55159 transitions. Second operand 6 states. [2019-12-27 03:01:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:42,121 INFO L93 Difference]: Finished difference Result 22885 states and 68158 transitions. [2019-12-27 03:01:42,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:01:42,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 03:01:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:42,155 INFO L225 Difference]: With dead ends: 22885 [2019-12-27 03:01:42,156 INFO L226 Difference]: Without dead ends: 22885 [2019-12-27 03:01:42,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:01:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22885 states. [2019-12-27 03:01:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22885 to 18692. [2019-12-27 03:01:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-27 03:01:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-27 03:01:42,460 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-27 03:01:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:42,461 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-27 03:01:42,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:01:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-27 03:01:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 03:01:42,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:42,480 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] [2019-12-27 03:01:42,480 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-27 03:01:42,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:42,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12570522] [2019-12-27 03:01:42,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:42,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12570522] [2019-12-27 03:01:42,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:42,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:01:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869930435] [2019-12-27 03:01:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:01:42,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:01:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:42,595 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-27 03:01:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:43,305 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-27 03:01:43,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:01:43,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 03:01:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:43,342 INFO L225 Difference]: With dead ends: 23844 [2019-12-27 03:01:43,342 INFO L226 Difference]: Without dead ends: 23844 [2019-12-27 03:01:43,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:01:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-27 03:01:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-27 03:01:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-27 03:01:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-27 03:01:43,632 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-27 03:01:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:43,633 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-27 03:01:43,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:01:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-27 03:01:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:01:43,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:43,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:43,649 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-27 03:01:43,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:43,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606655329] [2019-12-27 03:01:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:43,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606655329] [2019-12-27 03:01:43,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:43,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:43,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170598446] [2019-12-27 03:01:43,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:43,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:43,691 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-27 03:01:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:43,803 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-27 03:01:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:43,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 03:01:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:43,832 INFO L225 Difference]: With dead ends: 29593 [2019-12-27 03:01:43,832 INFO L226 Difference]: Without dead ends: 16129 [2019-12-27 03:01:43,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-27 03:01:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-27 03:01:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-27 03:01:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-27 03:01:44,064 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-27 03:01:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:44,064 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-27 03:01:44,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-27 03:01:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:01:44,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:44,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:44,080 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-27 03:01:44,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:44,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526526498] [2019-12-27 03:01:44,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:44,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526526498] [2019-12-27 03:01:44,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:44,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:44,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886080705] [2019-12-27 03:01:44,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:44,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:44,153 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-27 03:01:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:44,821 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-27 03:01:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:01:44,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:01:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:44,861 INFO L225 Difference]: With dead ends: 23632 [2019-12-27 03:01:44,861 INFO L226 Difference]: Without dead ends: 23632 [2019-12-27 03:01:44,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-27 03:01:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-27 03:01:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-27 03:01:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-27 03:01:45,424 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-27 03:01:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:45,424 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-27 03:01:45,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-27 03:01:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:01:45,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:45,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:45,456 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-27 03:01:45,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:45,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124074037] [2019-12-27 03:01:45,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:45,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124074037] [2019-12-27 03:01:45,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:45,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:01:45,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633016883] [2019-12-27 03:01:45,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:45,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:45,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:45,517 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-27 03:01:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:45,628 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-27 03:01:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:45,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:01:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:45,675 INFO L225 Difference]: With dead ends: 20526 [2019-12-27 03:01:45,675 INFO L226 Difference]: Without dead ends: 18967 [2019-12-27 03:01:45,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-27 03:01:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-27 03:01:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-27 03:01:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-27 03:01:46,218 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-27 03:01:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:46,219 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-27 03:01:46,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-27 03:01:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:46,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:46,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:46,250 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-27 03:01:46,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:46,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380036307] [2019-12-27 03:01:46,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:46,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380036307] [2019-12-27 03:01:46,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:46,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:46,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401263449] [2019-12-27 03:01:46,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:46,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:46,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:46,306 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-27 03:01:46,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:46,427 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-27 03:01:46,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:46,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:01:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:46,470 INFO L225 Difference]: With dead ends: 24294 [2019-12-27 03:01:46,471 INFO L226 Difference]: Without dead ends: 24294 [2019-12-27 03:01:46,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-27 03:01:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-27 03:01:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-27 03:01:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-27 03:01:46,993 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-27 03:01:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:46,994 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-27 03:01:46,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-27 03:01:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:47,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:47,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:47,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-27 03:01:47,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:47,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159482549] [2019-12-27 03:01:47,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:47,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159482549] [2019-12-27 03:01:47,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:47,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:01:47,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977811357] [2019-12-27 03:01:47,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:01:47,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:47,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:01:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:01:47,125 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-27 03:01:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:48,334 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-27 03:01:48,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:01:48,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 03:01:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:48,429 INFO L225 Difference]: With dead ends: 80145 [2019-12-27 03:01:48,429 INFO L226 Difference]: Without dead ends: 58918 [2019-12-27 03:01:48,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:01:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-27 03:01:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-27 03:01:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-27 03:01:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-27 03:01:49,414 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-27 03:01:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:49,414 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-27 03:01:49,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:01:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-27 03:01:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:49,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:49,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:49,448 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-27 03:01:49,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:49,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255632960] [2019-12-27 03:01:49,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:49,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255632960] [2019-12-27 03:01:49,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:49,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:01:49,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780593488] [2019-12-27 03:01:49,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:01:49,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:49,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:01:49,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:49,544 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-27 03:01:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:50,235 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-27 03:01:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:01:50,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:01:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:50,319 INFO L225 Difference]: With dead ends: 60723 [2019-12-27 03:01:50,320 INFO L226 Difference]: Without dead ends: 42175 [2019-12-27 03:01:50,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:01:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-27 03:01:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-27 03:01:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-27 03:01:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-27 03:01:50,869 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-27 03:01:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:50,869 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-27 03:01:50,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:01:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-27 03:01:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:50,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:50,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:50,894 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-27 03:01:50,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:50,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594374147] [2019-12-27 03:01:50,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:50,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594374147] [2019-12-27 03:01:50,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:50,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:50,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091555527] [2019-12-27 03:01:50,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:01:50,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:01:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:50,997 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-27 03:01:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:52,351 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-27 03:01:52,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:01:52,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 03:01:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:52,460 INFO L225 Difference]: With dead ends: 82000 [2019-12-27 03:01:52,461 INFO L226 Difference]: Without dead ends: 78263 [2019-12-27 03:01:52,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:01:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-27 03:01:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-27 03:01:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-27 03:01:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-27 03:01:53,680 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-27 03:01:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:53,680 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-27 03:01:53,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:01:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-27 03:01:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:53,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:53,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:53,703 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-27 03:01:53,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:53,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393423719] [2019-12-27 03:01:53,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:53,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393423719] [2019-12-27 03:01:53,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:53,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:53,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202002359] [2019-12-27 03:01:53,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:01:53,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:53,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:01:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:53,817 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-27 03:01:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:55,200 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-27 03:01:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:01:55,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 03:01:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:55,340 INFO L225 Difference]: With dead ends: 98855 [2019-12-27 03:01:55,340 INFO L226 Difference]: Without dead ends: 95231 [2019-12-27 03:01:55,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:01:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-27 03:01:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-27 03:01:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-27 03:01:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-27 03:01:56,215 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-27 03:01:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:56,216 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-27 03:01:56,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:01:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-27 03:01:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:56,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:56,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:56,242 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-27 03:01:56,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:56,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951015922] [2019-12-27 03:01:56,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:56,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951015922] [2019-12-27 03:01:56,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:56,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:01:56,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964864825] [2019-12-27 03:01:56,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:01:56,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:56,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:01:56,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:56,323 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-27 03:01:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:56,745 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-27 03:01:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:01:56,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:01:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:56,815 INFO L225 Difference]: With dead ends: 51563 [2019-12-27 03:01:56,815 INFO L226 Difference]: Without dead ends: 44912 [2019-12-27 03:01:56,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:01:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-27 03:01:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-27 03:01:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-27 03:01:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-27 03:01:57,748 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-27 03:01:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:57,748 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-27 03:01:57,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:01:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-27 03:01:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:57,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:57,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:57,774 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-27 03:01:57,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:57,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039559543] [2019-12-27 03:01:57,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:57,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039559543] [2019-12-27 03:01:57,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:57,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:57,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809348450] [2019-12-27 03:01:57,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:57,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:57,846 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 3 states. [2019-12-27 03:01:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:57,988 INFO L93 Difference]: Finished difference Result 30036 states and 90273 transitions. [2019-12-27 03:01:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:57,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:01:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:58,027 INFO L225 Difference]: With dead ends: 30036 [2019-12-27 03:01:58,027 INFO L226 Difference]: Without dead ends: 30036 [2019-12-27 03:01:58,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2019-12-27 03:01:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 25720. [2019-12-27 03:01:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25720 states. [2019-12-27 03:01:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25720 states to 25720 states and 77719 transitions. [2019-12-27 03:01:58,442 INFO L78 Accepts]: Start accepts. Automaton has 25720 states and 77719 transitions. Word has length 64 [2019-12-27 03:01:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:58,442 INFO L462 AbstractCegarLoop]: Abstraction has 25720 states and 77719 transitions. [2019-12-27 03:01:58,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25720 states and 77719 transitions. [2019-12-27 03:01:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:01:58,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:58,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:58,469 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 649944659, now seen corresponding path program 1 times [2019-12-27 03:01:58,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:58,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937935289] [2019-12-27 03:01:58,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:58,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937935289] [2019-12-27 03:01:58,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:58,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:01:58,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533451678] [2019-12-27 03:01:58,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:01:58,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:01:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:01:58,557 INFO L87 Difference]: Start difference. First operand 25720 states and 77719 transitions. Second operand 8 states. [2019-12-27 03:01:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:59,441 INFO L93 Difference]: Finished difference Result 68691 states and 204481 transitions. [2019-12-27 03:01:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:01:59,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 03:01:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:59,529 INFO L225 Difference]: With dead ends: 68691 [2019-12-27 03:01:59,529 INFO L226 Difference]: Without dead ends: 64109 [2019-12-27 03:01:59,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:01:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64109 states. [2019-12-27 03:02:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64109 to 25809. [2019-12-27 03:02:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25809 states. [2019-12-27 03:02:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25809 states to 25809 states and 78069 transitions. [2019-12-27 03:02:00,223 INFO L78 Accepts]: Start accepts. Automaton has 25809 states and 78069 transitions. Word has length 65 [2019-12-27 03:02:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:00,224 INFO L462 AbstractCegarLoop]: Abstraction has 25809 states and 78069 transitions. [2019-12-27 03:02:00,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:02:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25809 states and 78069 transitions. [2019-12-27 03:02:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:02:00,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:00,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:00,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:00,253 INFO L82 PathProgramCache]: Analyzing trace with hash -824760731, now seen corresponding path program 2 times [2019-12-27 03:02:00,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:00,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035594807] [2019-12-27 03:02:00,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:00,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035594807] [2019-12-27 03:02:00,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:00,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:02:00,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426477331] [2019-12-27 03:02:00,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:02:00,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:02:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:02:00,348 INFO L87 Difference]: Start difference. First operand 25809 states and 78069 transitions. Second operand 9 states. [2019-12-27 03:02:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:01,925 INFO L93 Difference]: Finished difference Result 79915 states and 236179 transitions. [2019-12-27 03:02:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:02:01,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 03:02:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:02,020 INFO L225 Difference]: With dead ends: 79915 [2019-12-27 03:02:02,020 INFO L226 Difference]: Without dead ends: 75333 [2019-12-27 03:02:02,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:02:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75333 states. [2019-12-27 03:02:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75333 to 25817. [2019-12-27 03:02:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25817 states. [2019-12-27 03:02:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25817 states to 25817 states and 78084 transitions. [2019-12-27 03:02:02,739 INFO L78 Accepts]: Start accepts. Automaton has 25817 states and 78084 transitions. Word has length 65 [2019-12-27 03:02:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:02,740 INFO L462 AbstractCegarLoop]: Abstraction has 25817 states and 78084 transitions. [2019-12-27 03:02:02,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:02:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25817 states and 78084 transitions. [2019-12-27 03:02:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:02:02,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:02,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:02,767 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1258547867, now seen corresponding path program 3 times [2019-12-27 03:02:02,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:02,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197119137] [2019-12-27 03:02:02,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:02,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197119137] [2019-12-27 03:02:02,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:02,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:02:02,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785460414] [2019-12-27 03:02:02,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:02:02,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:02:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:02:02,902 INFO L87 Difference]: Start difference. First operand 25817 states and 78084 transitions. Second operand 9 states. [2019-12-27 03:02:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:04,226 INFO L93 Difference]: Finished difference Result 88714 states and 261426 transitions. [2019-12-27 03:02:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:02:04,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 03:02:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:04,345 INFO L225 Difference]: With dead ends: 88714 [2019-12-27 03:02:04,345 INFO L226 Difference]: Without dead ends: 84158 [2019-12-27 03:02:04,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:02:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84158 states. [2019-12-27 03:02:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84158 to 25729. [2019-12-27 03:02:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25729 states. [2019-12-27 03:02:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25729 states to 25729 states and 77660 transitions. [2019-12-27 03:02:05,167 INFO L78 Accepts]: Start accepts. Automaton has 25729 states and 77660 transitions. Word has length 65 [2019-12-27 03:02:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:05,168 INFO L462 AbstractCegarLoop]: Abstraction has 25729 states and 77660 transitions. [2019-12-27 03:02:05,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:02:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25729 states and 77660 transitions. [2019-12-27 03:02:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:02:05,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:05,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:05,195 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -374970767, now seen corresponding path program 4 times [2019-12-27 03:02:05,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:05,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109190884] [2019-12-27 03:02:05,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:05,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109190884] [2019-12-27 03:02:05,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:05,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:02:05,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53322254] [2019-12-27 03:02:05,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:02:05,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:02:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:02:05,260 INFO L87 Difference]: Start difference. First operand 25729 states and 77660 transitions. Second operand 4 states. [2019-12-27 03:02:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:05,480 INFO L93 Difference]: Finished difference Result 25729 states and 77465 transitions. [2019-12-27 03:02:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:02:05,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 03:02:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:05,540 INFO L225 Difference]: With dead ends: 25729 [2019-12-27 03:02:05,540 INFO L226 Difference]: Without dead ends: 25729 [2019-12-27 03:02:05,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25729 states. [2019-12-27 03:02:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25729 to 24043. [2019-12-27 03:02:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24043 states. [2019-12-27 03:02:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24043 states to 24043 states and 72396 transitions. [2019-12-27 03:02:06,222 INFO L78 Accepts]: Start accepts. Automaton has 24043 states and 72396 transitions. Word has length 65 [2019-12-27 03:02:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:06,222 INFO L462 AbstractCegarLoop]: Abstraction has 24043 states and 72396 transitions. [2019-12-27 03:02:06,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:02:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 24043 states and 72396 transitions. [2019-12-27 03:02:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:02:06,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:06,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:06,247 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:06,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:06,247 INFO L82 PathProgramCache]: Analyzing trace with hash -704047196, now seen corresponding path program 1 times [2019-12-27 03:02:06,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:06,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189919467] [2019-12-27 03:02:06,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:06,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189919467] [2019-12-27 03:02:06,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:06,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:02:06,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925484383] [2019-12-27 03:02:06,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:02:06,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:02:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:02:06,363 INFO L87 Difference]: Start difference. First operand 24043 states and 72396 transitions. Second operand 8 states. [2019-12-27 03:02:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:08,392 INFO L93 Difference]: Finished difference Result 45643 states and 133812 transitions. [2019-12-27 03:02:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:02:08,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 03:02:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:08,455 INFO L225 Difference]: With dead ends: 45643 [2019-12-27 03:02:08,455 INFO L226 Difference]: Without dead ends: 45264 [2019-12-27 03:02:08,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:02:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45264 states. [2019-12-27 03:02:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45264 to 26685. [2019-12-27 03:02:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26685 states. [2019-12-27 03:02:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26685 states to 26685 states and 80382 transitions. [2019-12-27 03:02:09,045 INFO L78 Accepts]: Start accepts. Automaton has 26685 states and 80382 transitions. Word has length 65 [2019-12-27 03:02:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:09,046 INFO L462 AbstractCegarLoop]: Abstraction has 26685 states and 80382 transitions. [2019-12-27 03:02:09,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:02:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 26685 states and 80382 transitions. [2019-12-27 03:02:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:02:09,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:09,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:09,075 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash 720231034, now seen corresponding path program 2 times [2019-12-27 03:02:09,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:09,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724391964] [2019-12-27 03:02:09,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:09,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724391964] [2019-12-27 03:02:09,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:09,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:02:09,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103845466] [2019-12-27 03:02:09,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:02:09,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:02:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:02:09,260 INFO L87 Difference]: Start difference. First operand 26685 states and 80382 transitions. Second operand 10 states. [2019-12-27 03:02:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:11,241 INFO L93 Difference]: Finished difference Result 45069 states and 134601 transitions. [2019-12-27 03:02:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:02:11,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 03:02:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:11,322 INFO L225 Difference]: With dead ends: 45069 [2019-12-27 03:02:11,322 INFO L226 Difference]: Without dead ends: 44849 [2019-12-27 03:02:11,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:02:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44849 states. [2019-12-27 03:02:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44849 to 30893. [2019-12-27 03:02:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30893 states. [2019-12-27 03:02:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30893 states to 30893 states and 92977 transitions. [2019-12-27 03:02:12,272 INFO L78 Accepts]: Start accepts. Automaton has 30893 states and 92977 transitions. Word has length 65 [2019-12-27 03:02:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:12,272 INFO L462 AbstractCegarLoop]: Abstraction has 30893 states and 92977 transitions. [2019-12-27 03:02:12,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:02:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 30893 states and 92977 transitions. [2019-12-27 03:02:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:02:12,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:12,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:12,306 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1426652930, now seen corresponding path program 3 times [2019-12-27 03:02:12,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:12,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153831810] [2019-12-27 03:02:12,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:12,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153831810] [2019-12-27 03:02:12,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:12,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:02:12,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834616165] [2019-12-27 03:02:12,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:12,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:12,369 INFO L87 Difference]: Start difference. First operand 30893 states and 92977 transitions. Second operand 3 states. [2019-12-27 03:02:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:12,510 INFO L93 Difference]: Finished difference Result 30893 states and 92976 transitions. [2019-12-27 03:02:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:12,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:02:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:12,582 INFO L225 Difference]: With dead ends: 30893 [2019-12-27 03:02:12,582 INFO L226 Difference]: Without dead ends: 30893 [2019-12-27 03:02:12,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30893 states. [2019-12-27 03:02:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30893 to 22712. [2019-12-27 03:02:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22712 states. [2019-12-27 03:02:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22712 states to 22712 states and 69674 transitions. [2019-12-27 03:02:13,344 INFO L78 Accepts]: Start accepts. Automaton has 22712 states and 69674 transitions. Word has length 65 [2019-12-27 03:02:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:13,344 INFO L462 AbstractCegarLoop]: Abstraction has 22712 states and 69674 transitions. [2019-12-27 03:02:13,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22712 states and 69674 transitions. [2019-12-27 03:02:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:02:13,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:13,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:13,381 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1061804981, now seen corresponding path program 1 times [2019-12-27 03:02:13,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:13,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209428866] [2019-12-27 03:02:13,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:13,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209428866] [2019-12-27 03:02:13,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:13,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:02:13,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582401193] [2019-12-27 03:02:13,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:02:13,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:02:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:13,460 INFO L87 Difference]: Start difference. First operand 22712 states and 69674 transitions. Second operand 3 states. [2019-12-27 03:02:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:13,540 INFO L93 Difference]: Finished difference Result 17570 states and 52903 transitions. [2019-12-27 03:02:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:13,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:02:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:13,569 INFO L225 Difference]: With dead ends: 17570 [2019-12-27 03:02:13,569 INFO L226 Difference]: Without dead ends: 17570 [2019-12-27 03:02:13,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:02:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17570 states. [2019-12-27 03:02:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17570 to 16533. [2019-12-27 03:02:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16533 states. [2019-12-27 03:02:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16533 states to 16533 states and 49710 transitions. [2019-12-27 03:02:13,820 INFO L78 Accepts]: Start accepts. Automaton has 16533 states and 49710 transitions. Word has length 66 [2019-12-27 03:02:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:13,820 INFO L462 AbstractCegarLoop]: Abstraction has 16533 states and 49710 transitions. [2019-12-27 03:02:13,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:02:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 16533 states and 49710 transitions. [2019-12-27 03:02:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:13,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:13,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:13,838 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:13,838 INFO L82 PathProgramCache]: Analyzing trace with hash 28997027, now seen corresponding path program 1 times [2019-12-27 03:02:13,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:13,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398692176] [2019-12-27 03:02:13,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:14,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398692176] [2019-12-27 03:02:14,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:14,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:02:14,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301258981] [2019-12-27 03:02:14,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:02:14,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:02:14,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:02:14,008 INFO L87 Difference]: Start difference. First operand 16533 states and 49710 transitions. Second operand 11 states. [2019-12-27 03:02:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:15,109 INFO L93 Difference]: Finished difference Result 37123 states and 110641 transitions. [2019-12-27 03:02:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 03:02:15,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 03:02:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:15,150 INFO L225 Difference]: With dead ends: 37123 [2019-12-27 03:02:15,150 INFO L226 Difference]: Without dead ends: 28679 [2019-12-27 03:02:15,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 03:02:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28679 states. [2019-12-27 03:02:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28679 to 16869. [2019-12-27 03:02:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16869 states. [2019-12-27 03:02:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16869 states to 16869 states and 50266 transitions. [2019-12-27 03:02:15,475 INFO L78 Accepts]: Start accepts. Automaton has 16869 states and 50266 transitions. Word has length 67 [2019-12-27 03:02:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:15,475 INFO L462 AbstractCegarLoop]: Abstraction has 16869 states and 50266 transitions. [2019-12-27 03:02:15,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:02:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 16869 states and 50266 transitions. [2019-12-27 03:02:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:15,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:15,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:15,493 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1689948735, now seen corresponding path program 2 times [2019-12-27 03:02:15,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:15,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624510313] [2019-12-27 03:02:15,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:15,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624510313] [2019-12-27 03:02:15,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:15,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:02:15,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314777719] [2019-12-27 03:02:15,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:02:15,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:02:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:02:15,681 INFO L87 Difference]: Start difference. First operand 16869 states and 50266 transitions. Second operand 12 states. [2019-12-27 03:02:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:16,694 INFO L93 Difference]: Finished difference Result 29131 states and 86143 transitions. [2019-12-27 03:02:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:02:16,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 03:02:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:16,732 INFO L225 Difference]: With dead ends: 29131 [2019-12-27 03:02:16,733 INFO L226 Difference]: Without dead ends: 28249 [2019-12-27 03:02:16,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:02:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28249 states. [2019-12-27 03:02:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28249 to 16207. [2019-12-27 03:02:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16207 states. [2019-12-27 03:02:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16207 states to 16207 states and 48445 transitions. [2019-12-27 03:02:17,050 INFO L78 Accepts]: Start accepts. Automaton has 16207 states and 48445 transitions. Word has length 67 [2019-12-27 03:02:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:17,050 INFO L462 AbstractCegarLoop]: Abstraction has 16207 states and 48445 transitions. [2019-12-27 03:02:17,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:02:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16207 states and 48445 transitions. [2019-12-27 03:02:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:17,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:17,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:17,067 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 3 times [2019-12-27 03:02:17,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:17,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340424209] [2019-12-27 03:02:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:02:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:02:17,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:02:17,454 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:02:17,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1501~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1501~0.base_44|) |v_ULTIMATE.start_main_~#t1501~0.offset_28| 0)) |v_#memory_int_19|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1501~0.base_44| 4)) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1501~0.base_44| 1)) (= |v_ULTIMATE.start_main_~#t1501~0.offset_28| 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 v_~z$r_buff0_thd3~0_371) (= v_~main$tmp_guard1~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1501~0.base_44|) 0) (= v_~z$r_buff1_thd0~0_199 0) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1501~0.base_44|) (= v_~y~0_49 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1501~0.base=|v_ULTIMATE.start_main_~#t1501~0.base_44|, ULTIMATE.start_main_~#t1501~0.offset=|v_ULTIMATE.start_main_~#t1501~0.offset_28|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t1502~0.offset=|v_ULTIMATE.start_main_~#t1502~0.offset_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1503~0.base=|v_ULTIMATE.start_main_~#t1503~0.base_25|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1503~0.offset=|v_ULTIMATE.start_main_~#t1503~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, ULTIMATE.start_main_~#t1502~0.base=|v_ULTIMATE.start_main_~#t1502~0.base_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1501~0.base, ULTIMATE.start_main_~#t1501~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t1502~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1503~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1503~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1502~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 03:02:17,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1502~0.base_13| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1502~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1502~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1502~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1502~0.base_13|) |v_ULTIMATE.start_main_~#t1502~0.offset_11| 1))) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1502~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1502~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1502~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1502~0.offset=|v_ULTIMATE.start_main_~#t1502~0.offset_11|, ULTIMATE.start_main_~#t1502~0.base=|v_ULTIMATE.start_main_~#t1502~0.base_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1502~0.offset, ULTIMATE.start_main_~#t1502~0.base, #length] because there is no mapped edge [2019-12-27 03:02:17,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1503~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1503~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1503~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1503~0.base_13|) |v_ULTIMATE.start_main_~#t1503~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1503~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1503~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1503~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1503~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1503~0.offset=|v_ULTIMATE.start_main_~#t1503~0.offset_11|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1503~0.base=|v_ULTIMATE.start_main_~#t1503~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1503~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1503~0.base] because there is no mapped edge [2019-12-27 03:02:17,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:02:17,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In944832165 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite21_Out944832165| |P2Thread1of1ForFork2_#t~ite20_Out944832165|) .cse0 (= ~z$w_buff0~0_In944832165 |P2Thread1of1ForFork2_#t~ite20_Out944832165|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In944832165 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In944832165 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In944832165 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In944832165 256)))))) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In944832165| |P2Thread1of1ForFork2_#t~ite20_Out944832165|) (= ~z$w_buff0~0_In944832165 |P2Thread1of1ForFork2_#t~ite21_Out944832165|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In944832165, ~z$w_buff0_used~0=~z$w_buff0_used~0_In944832165, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In944832165|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In944832165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In944832165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In944832165, ~weak$$choice2~0=~weak$$choice2~0_In944832165} OutVars{~z$w_buff0~0=~z$w_buff0~0_In944832165, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out944832165|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In944832165, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out944832165|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In944832165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In944832165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In944832165, ~weak$$choice2~0=~weak$$choice2~0_In944832165} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:02:17,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In541582612 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out541582612| |P1Thread1of1ForFork1_#t~ite9_Out541582612|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In541582612 256)))) (or (and (= ~z~0_In541582612 |P1Thread1of1ForFork1_#t~ite9_Out541582612|) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (= ~z$w_buff1~0_In541582612 |P1Thread1of1ForFork1_#t~ite9_Out541582612|) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In541582612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In541582612, ~z$w_buff1~0=~z$w_buff1~0_In541582612, ~z~0=~z~0_In541582612} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out541582612|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In541582612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In541582612, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out541582612|, ~z$w_buff1~0=~z$w_buff1~0_In541582612, ~z~0=~z~0_In541582612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 03:02:17,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1554732244 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1554732244 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1554732244| ~z$w_buff0_used~0_In-1554732244) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1554732244| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1554732244, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1554732244} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1554732244|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1554732244, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1554732244} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:02:17,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In155675213 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In155675213 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In155675213 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In155675213 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out155675213| ~z$w_buff1_used~0_In155675213) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out155675213| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In155675213, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In155675213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155675213, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In155675213} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out155675213|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In155675213, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In155675213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155675213, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In155675213} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:02:17,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1249721031 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1249721031 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1249721031 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out1249721031 ~z$r_buff0_thd1~0_In1249721031)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1249721031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1249721031} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1249721031, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1249721031|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1249721031} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:02:17,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-401784435 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-401784435 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-401784435| ~z$w_buff0_used~0_In-401784435)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-401784435| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-401784435, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-401784435} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-401784435, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-401784435|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-401784435} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:02:17,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-864499866 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-864499866 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-864499866 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-864499866 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-864499866| ~z$w_buff1_used~0_In-864499866)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-864499866| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-864499866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-864499866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-864499866, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-864499866} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-864499866, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-864499866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-864499866, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-864499866|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-864499866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:02:17,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1021349833 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1021349833 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1021349833| ~z$r_buff0_thd2~0_In-1021349833) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1021349833|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1021349833, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1021349833} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1021349833, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1021349833|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1021349833} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:02:17,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-462889267 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-462889267 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-462889267 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-462889267 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-462889267| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-462889267| ~z$r_buff1_thd2~0_In-462889267) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-462889267, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-462889267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-462889267, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-462889267} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-462889267, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-462889267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-462889267, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-462889267|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-462889267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:02:17,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:02:17,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 03:02:17,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-87332854 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite36_Out-87332854| |P2Thread1of1ForFork2_#t~ite35_Out-87332854|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-87332854 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-87332854 256)) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-87332854 256))) (= 0 (mod ~z$w_buff0_used~0_In-87332854 256)))) (= |P2Thread1of1ForFork2_#t~ite35_Out-87332854| ~z$r_buff1_thd3~0_In-87332854) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite35_In-87332854| |P2Thread1of1ForFork2_#t~ite35_Out-87332854|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out-87332854| ~z$r_buff1_thd3~0_In-87332854)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In-87332854|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-87332854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-87332854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-87332854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-87332854, ~weak$$choice2~0=~weak$$choice2~0_In-87332854} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-87332854|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-87332854|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-87332854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-87332854, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-87332854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-87332854, ~weak$$choice2~0=~weak$$choice2~0_In-87332854} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 03:02:17,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 03:02:17,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2054097140 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out2054097140| |P2Thread1of1ForFork2_#t~ite38_Out2054097140|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2054097140 256)))) (or (and (= ~z~0_In2054097140 |P2Thread1of1ForFork2_#t~ite38_Out2054097140|) (or .cse0 .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out2054097140| ~z$w_buff1~0_In2054097140) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2054097140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2054097140, ~z$w_buff1~0=~z$w_buff1~0_In2054097140, ~z~0=~z~0_In2054097140} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2054097140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2054097140, ~z$w_buff1~0=~z$w_buff1~0_In2054097140, ~z~0=~z~0_In2054097140, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out2054097140|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out2054097140|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 03:02:17,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In392764522 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In392764522 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out392764522| 0)) (and (= ~z$w_buff0_used~0_In392764522 |P2Thread1of1ForFork2_#t~ite40_Out392764522|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In392764522, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In392764522} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In392764522, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In392764522, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out392764522|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 03:02:17,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In1961401632 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1961401632 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1961401632 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1961401632 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out1961401632| ~z$w_buff1_used~0_In1961401632) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite41_Out1961401632| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1961401632, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1961401632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961401632, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1961401632} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1961401632|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961401632, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1961401632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961401632, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1961401632} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 03:02:17,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-388349080 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-388349080 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-388349080| ~z$r_buff0_thd3~0_In-388349080) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-388349080| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-388349080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-388349080} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-388349080|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-388349080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-388349080} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 03:02:17,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In553350160 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In553350160 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In553350160 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In553350160 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out553350160|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In553350160 |P2Thread1of1ForFork2_#t~ite43_Out553350160|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In553350160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In553350160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In553350160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In553350160} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In553350160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In553350160, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out553350160|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In553350160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In553350160} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 03:02:17,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:02:17,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-113526663 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-113526663 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-113526663 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-113526663 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-113526663| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-113526663| ~z$r_buff1_thd1~0_In-113526663)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-113526663, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-113526663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-113526663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-113526663} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-113526663, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-113526663|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-113526663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-113526663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-113526663} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:02:17,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:02:17,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:02:17,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1440331292| |ULTIMATE.start_main_#t~ite48_Out1440331292|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1440331292 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1440331292 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In1440331292 |ULTIMATE.start_main_#t~ite47_Out1440331292|) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1440331292 |ULTIMATE.start_main_#t~ite47_Out1440331292|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1440331292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1440331292, ~z$w_buff1~0=~z$w_buff1~0_In1440331292, ~z~0=~z~0_In1440331292} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1440331292, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1440331292|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1440331292, ~z$w_buff1~0=~z$w_buff1~0_In1440331292, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1440331292|, ~z~0=~z~0_In1440331292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:02:17,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2105578224 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2105578224 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2105578224 |ULTIMATE.start_main_#t~ite49_Out-2105578224|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2105578224|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2105578224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105578224} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2105578224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105578224, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2105578224|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 03:02:17,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1371736466 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1371736466 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1371736466 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1371736466 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1371736466 |ULTIMATE.start_main_#t~ite50_Out-1371736466|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1371736466| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1371736466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1371736466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1371736466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1371736466} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1371736466|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1371736466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1371736466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1371736466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1371736466} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 03:02:17,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1973567445 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1973567445 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1973567445| ~z$r_buff0_thd0~0_In1973567445)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1973567445| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1973567445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1973567445} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1973567445, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1973567445|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1973567445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 03:02:17,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1472661601 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1472661601 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1472661601 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1472661601 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1472661601| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1472661601| ~z$r_buff1_thd0~0_In1472661601) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1472661601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1472661601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1472661601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1472661601} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1472661601|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1472661601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1472661601, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1472661601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1472661601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 03:02:17,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:02:17,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:02:17 BasicIcfg [2019-12-27 03:02:17,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:02:17,594 INFO L168 Benchmark]: Toolchain (without parser) took 104248.95 ms. Allocated memory was 136.3 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,594 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.25 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 99.2 MB in the beginning and 153.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 199.8 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,596 INFO L168 Benchmark]: Boogie Preprocessor took 47.84 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 147.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,596 INFO L168 Benchmark]: RCFGBuilder took 865.00 ms. Allocated memory is still 199.8 MB. Free memory was 147.8 MB in the beginning and 98.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,596 INFO L168 Benchmark]: TraceAbstraction took 102509.91 ms. Allocated memory was 199.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 03:02:17,599 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.21 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.25 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 99.2 MB in the beginning and 153.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 199.8 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.84 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 147.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.00 ms. Allocated memory is still 199.8 MB. Free memory was 147.8 MB in the beginning and 98.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102509.91 ms. Allocated memory was 199.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 97.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.0s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.1s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 34.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8987 SDtfs, 11175 SDslu, 29013 SDs, 0 SdLazy, 13299 SolverSat, 445 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 100 SyntacticMatches, 23 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 520602 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1487 ConstructedInterpolants, 0 QuantifiedInterpolants, 273222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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 proved your program to be incorrect! Received shutdown request...