/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:56:52,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:56:52,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:56:53,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:56:53,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:56:53,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:56:53,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:56:53,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:56:53,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:56:53,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:56:53,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:56:53,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:56:53,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:56:53,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:56:53,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:56:53,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:56:53,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:56:53,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:56:53,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:56:53,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:56:53,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:56:53,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:56:53,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:56:53,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:56:53,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:56:53,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:56:53,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:56:53,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:56:53,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:56:53,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:56:53,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:56:53,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:56:53,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:56:53,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:56:53,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:56:53,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:56:53,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:56:53,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:56:53,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:56:53,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:56:53,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:56:53,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:56:53,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:56:53,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:56:53,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:56:53,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:56:53,067 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:56:53,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:56:53,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:56:53,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:56:53,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:56:53,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:56:53,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:56:53,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:56:53,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:56:53,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:56:53,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:56:53,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:56:53,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:56:53,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:56:53,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:56:53,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:56:53,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:56:53,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:56:53,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:56:53,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:56:53,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:56:53,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:56:53,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:56:53,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:56:53,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:56:53,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:56:53,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:56:53,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:56:53,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:56:53,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:56:53,373 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:56:53,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-26 21:56:53,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ff283f3/d8ee22610199444d9aae097c167ea83d/FLAGf68a26b40 [2019-12-26 21:56:54,010 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:56:54,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2019-12-26 21:56:54,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ff283f3/d8ee22610199444d9aae097c167ea83d/FLAGf68a26b40 [2019-12-26 21:56:54,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ff283f3/d8ee22610199444d9aae097c167ea83d [2019-12-26 21:56:54,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:56:54,308 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:56:54,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:56:54,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:56:54,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:56:54,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:56:54" (1/1) ... [2019-12-26 21:56:54,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:54, skipping insertion in model container [2019-12-26 21:56:54,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:56:54" (1/1) ... [2019-12-26 21:56:54,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:56:54,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:56:55,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:56:55,015 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:56:55,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:56:55,153 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:56:55,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55 WrapperNode [2019-12-26 21:56:55,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:56:55,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:56:55,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:56:55,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:56:55,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:56:55,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:56:55,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:56:55,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:56:55,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (1/1) ... [2019-12-26 21:56:55,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:56:55,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:56:55,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:56:55,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:56:55,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (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-26 21:56:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:56:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:56:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:56:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:56:55,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:56:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:56:55,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:56:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:56:55,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:56:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:56:55,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:56:55,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:56:55,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:56:55,342 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:56:56,149 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:56:56,150 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:56:56,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:56:56 BoogieIcfgContainer [2019-12-26 21:56:56,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:56:56,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:56:56,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:56:56,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:56:56,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:56:54" (1/3) ... [2019-12-26 21:56:56,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f93e151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:56:56, skipping insertion in model container [2019-12-26 21:56:56,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:56:55" (2/3) ... [2019-12-26 21:56:56,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f93e151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:56:56, skipping insertion in model container [2019-12-26 21:56:56,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:56:56" (3/3) ... [2019-12-26 21:56:56,160 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc.i [2019-12-26 21:56:56,171 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:56:56,171 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:56:56,179 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:56:56,181 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:56:56,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,225 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,225 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,225 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,234 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,234 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,259 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,260 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,288 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,290 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:56:56,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:56:56,338 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:56:56,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:56:56,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:56:56,339 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:56:56,339 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:56:56,339 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:56:56,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:56:56,339 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:56:56,357 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:56:56,359 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:56:56,466 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:56:56,466 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:56:56,484 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:56:56,511 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:56:56,567 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:56:56,567 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:56:56,576 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:56:56,597 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:56:56,598 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:57:01,702 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-26 21:57:02,124 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:57:02,268 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:57:02,287 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-26 21:57:02,287 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 21:57:02,290 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-26 21:57:21,385 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-26 21:57:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-26 21:57:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:57:21,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:21,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:57:21,395 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-26 21:57:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-26 21:57:21,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:21,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786901371] [2019-12-26 21:57:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:57:21,634 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-26 21:57:21,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786901371] [2019-12-26 21:57:21,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:57:21,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:57:21,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038457118] [2019-12-26 21:57:21,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:57:21,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:57:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:57:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:57:21,662 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-26 21:57:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:57:23,189 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-26 21:57:23,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:57:23,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:57:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:57:23,946 INFO L225 Difference]: With dead ends: 114110 [2019-12-26 21:57:23,947 INFO L226 Difference]: Without dead ends: 107012 [2019-12-26 21:57:23,949 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-26 21:57:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-26 21:57:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-26 21:57:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-26 21:57:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-26 21:57:36,727 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-26 21:57:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:57:36,727 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-26 21:57:36,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:57:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-26 21:57:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:57:36,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:36,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:57:36,732 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-26 21:57:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-26 21:57:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:36,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075720018] [2019-12-26 21:57:36,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:57:36,928 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-26 21:57:36,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075720018] [2019-12-26 21:57:36,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:57:36,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:57:36,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503365993] [2019-12-26 21:57:36,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:57:36,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:57:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:57:36,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:57:36,932 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-26 21:57:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:57:42,407 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-26 21:57:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:57:42,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:57:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:57:43,147 INFO L225 Difference]: With dead ends: 166210 [2019-12-26 21:57:43,148 INFO L226 Difference]: Without dead ends: 166161 [2019-12-26 21:57:43,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:57:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-26 21:57:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-26 21:57:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-26 21:57:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-26 21:57:51,953 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-26 21:57:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:57:51,953 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-26 21:57:51,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:57:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-26 21:57:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:57:51,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:51,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:57:51,960 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-26 21:57:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-26 21:57:51,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:51,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170757893] [2019-12-26 21:57:51,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:57:52,012 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-26 21:57:52,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170757893] [2019-12-26 21:57:52,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:57:52,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:57:52,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351105409] [2019-12-26 21:57:52,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:57:52,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:57:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:57:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:57:52,014 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-26 21:57:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:57:56,588 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-26 21:57:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:57:56,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:57:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:57:56,643 INFO L225 Difference]: With dead ends: 33068 [2019-12-26 21:57:56,643 INFO L226 Difference]: Without dead ends: 33068 [2019-12-26 21:57:56,643 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-26 21:57:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-26 21:57:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-26 21:57:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-26 21:57:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-26 21:57:57,307 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-26 21:57:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:57:57,307 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-26 21:57:57,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:57:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-26 21:57:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:57:57,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:57,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:57:57,311 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-26 21:57:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-26 21:57:57,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:57,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839401310] [2019-12-26 21:57:57,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:57:57,441 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-26 21:57:57,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839401310] [2019-12-26 21:57:57,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:57:57,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:57:57,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518558721] [2019-12-26 21:57:57,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:57:57,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:57:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:57:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:57:57,444 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-26 21:57:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:57:57,934 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-26 21:57:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:57:57,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:57:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:57:58,006 INFO L225 Difference]: With dead ends: 45410 [2019-12-26 21:57:58,006 INFO L226 Difference]: Without dead ends: 45410 [2019-12-26 21:57:58,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:57:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-26 21:57:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-26 21:57:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-26 21:57:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-26 21:57:59,282 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-26 21:57:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:57:59,283 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-26 21:57:59,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:57:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-26 21:57:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:57:59,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:59,292 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-26 21:57:59,292 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-26 21:57:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-26 21:57:59,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:59,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131434069] [2019-12-26 21:57:59,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:57:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:57:59,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131434069] [2019-12-26 21:57:59,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:57:59,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:57:59,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916031627] [2019-12-26 21:57:59,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:57:59,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:57:59,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:57:59,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:57:59,502 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-26 21:58:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:00,673 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-26 21:58:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:58:00,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:58:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:00,765 INFO L225 Difference]: With dead ends: 56872 [2019-12-26 21:58:00,765 INFO L226 Difference]: Without dead ends: 56865 [2019-12-26 21:58:00,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:58:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-26 21:58:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-26 21:58:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-26 21:58:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-26 21:58:01,572 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-26 21:58:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:01,572 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-26 21:58:01,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:58:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-26 21:58:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:58:01,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:01,586 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-26 21:58:01,586 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-26 21:58:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:01,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-26 21:58:01,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:01,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541078535] [2019-12-26 21:58:01,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:01,643 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-26 21:58:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541078535] [2019-12-26 21:58:01,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:01,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:58:01,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543367850] [2019-12-26 21:58:01,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:58:01,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:58:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:58:01,646 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-26 21:58:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:01,703 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-26 21:58:01,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:58:01,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:58:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:01,727 INFO L225 Difference]: With dead ends: 16014 [2019-12-26 21:58:01,728 INFO L226 Difference]: Without dead ends: 16014 [2019-12-26 21:58:01,728 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-26 21:58:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-26 21:58:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-26 21:58:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-26 21:58:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-26 21:58:01,970 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-26 21:58:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:01,970 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-26 21:58:01,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:58:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-26 21:58:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:58:01,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:01,982 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-26 21:58:01,982 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-26 21:58:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-26 21:58:01,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:01,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415891074] [2019-12-26 21:58:01,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:02,120 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-26 21:58:02,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415891074] [2019-12-26 21:58:02,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:02,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:58:02,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498115318] [2019-12-26 21:58:02,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:58:02,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:02,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:58:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:58:02,122 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-26 21:58:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:02,860 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-26 21:58:02,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:58:02,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:58:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:02,903 INFO L225 Difference]: With dead ends: 22624 [2019-12-26 21:58:02,903 INFO L226 Difference]: Without dead ends: 22624 [2019-12-26 21:58:02,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:58:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-26 21:58:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-26 21:58:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-26 21:58:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-26 21:58:03,359 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-26 21:58:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:03,360 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-26 21:58:03,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:58:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-26 21:58:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:58:03,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:03,378 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-26 21:58:03,378 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-26 21:58:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-26 21:58:03,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:03,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928960455] [2019-12-26 21:58:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:03,546 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-26 21:58:03,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928960455] [2019-12-26 21:58:03,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:03,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:58:03,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497847544] [2019-12-26 21:58:03,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:58:03,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:58:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:58:03,548 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-26 21:58:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:04,826 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-26 21:58:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:58:04,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:58:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:04,873 INFO L225 Difference]: With dead ends: 24689 [2019-12-26 21:58:04,874 INFO L226 Difference]: Without dead ends: 24689 [2019-12-26 21:58:04,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:58:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-26 21:58:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-26 21:58:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-26 21:58:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-26 21:58:05,203 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-26 21:58:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:05,203 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-26 21:58:05,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:58:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-26 21:58:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:58:05,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:05,226 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-26 21:58:05,226 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-26 21:58:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-26 21:58:05,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:05,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805332905] [2019-12-26 21:58:05,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:05,285 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-26 21:58:05,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805332905] [2019-12-26 21:58:05,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:05,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:58:05,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405526483] [2019-12-26 21:58:05,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:58:05,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:58:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:05,288 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-26 21:58:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:05,446 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-26 21:58:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:05,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:58:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:05,478 INFO L225 Difference]: With dead ends: 31245 [2019-12-26 21:58:05,478 INFO L226 Difference]: Without dead ends: 17019 [2019-12-26 21:58:05,479 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-26 21:58:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-26 21:58:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-26 21:58:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-26 21:58:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-26 21:58:05,760 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-26 21:58:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:05,760 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-26 21:58:05,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:58:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-26 21:58:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:58:05,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:05,783 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-26 21:58:05,783 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-26 21:58:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:05,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-26 21:58:05,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:05,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250986678] [2019-12-26 21:58:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:05,849 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-26 21:58:05,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250986678] [2019-12-26 21:58:05,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:05,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:58:05,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586953007] [2019-12-26 21:58:05,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:58:05,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:05,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:58:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:58:05,851 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-26 21:58:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:05,950 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-26 21:58:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:58:05,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 21:58:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:05,965 INFO L225 Difference]: With dead ends: 24032 [2019-12-26 21:58:05,965 INFO L226 Difference]: Without dead ends: 10093 [2019-12-26 21:58:05,965 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-26 21:58:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-26 21:58:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-26 21:58:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-26 21:58:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-26 21:58:06,119 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-26 21:58:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:06,119 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-26 21:58:06,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:58:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-26 21:58:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:58:06,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:06,132 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-26 21:58:06,132 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-26 21:58:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-26 21:58:06,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:06,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400930057] [2019-12-26 21:58:06,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:06,197 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-26 21:58:06,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400930057] [2019-12-26 21:58:06,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:06,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:58:06,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771895576] [2019-12-26 21:58:06,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:58:06,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:58:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:58:06,199 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-26 21:58:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:06,252 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-26 21:58:06,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:58:06,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:58:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:06,265 INFO L225 Difference]: With dead ends: 9224 [2019-12-26 21:58:06,265 INFO L226 Difference]: Without dead ends: 6480 [2019-12-26 21:58:06,266 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-26 21:58:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-26 21:58:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-26 21:58:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-26 21:58:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-26 21:58:06,400 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-26 21:58:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:06,400 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-26 21:58:06,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:58:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-26 21:58:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:06,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:06,409 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-26 21:58:06,409 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-26 21:58:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-26 21:58:06,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:06,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754788674] [2019-12-26 21:58:06,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:06,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-26 21:58:06,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754788674] [2019-12-26 21:58:06,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:06,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:58:06,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872345759] [2019-12-26 21:58:06,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:58:06,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:58:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:06,460 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-26 21:58:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:06,527 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-26 21:58:06,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:06,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:58:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:06,540 INFO L225 Difference]: With dead ends: 9612 [2019-12-26 21:58:06,541 INFO L226 Difference]: Without dead ends: 9612 [2019-12-26 21:58:06,541 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-26 21:58:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-26 21:58:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-26 21:58:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-26 21:58:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-26 21:58:06,773 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-26 21:58:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:06,773 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-26 21:58:06,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:58:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-26 21:58:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:06,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:06,782 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-26 21:58:06,782 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-26 21:58:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-26 21:58:06,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:06,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034313834] [2019-12-26 21:58:06,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:06,871 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-26 21:58:06,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034313834] [2019-12-26 21:58:06,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:06,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:58:06,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872210958] [2019-12-26 21:58:06,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:58:06,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:06,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:58:06,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:58:06,873 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-26 21:58:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:07,160 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-26 21:58:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:58:07,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:58:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:07,177 INFO L225 Difference]: With dead ends: 14786 [2019-12-26 21:58:07,177 INFO L226 Difference]: Without dead ends: 11103 [2019-12-26 21:58:07,177 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-26 21:58:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-26 21:58:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-26 21:58:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-26 21:58:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-26 21:58:07,346 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-26 21:58:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:07,347 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-26 21:58:07,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:58:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-26 21:58:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:07,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:07,358 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-26 21:58:07,358 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-26 21:58:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-26 21:58:07,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:07,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518711652] [2019-12-26 21:58:07,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:07,449 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-26 21:58:07,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518711652] [2019-12-26 21:58:07,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:07,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:58:07,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510320998] [2019-12-26 21:58:07,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:58:07,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:58:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:58:07,452 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-26 21:58:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:07,733 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-26 21:58:07,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:58:07,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:58:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:07,752 INFO L225 Difference]: With dead ends: 16709 [2019-12-26 21:58:07,753 INFO L226 Difference]: Without dead ends: 12623 [2019-12-26 21:58:07,753 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-26 21:58:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-26 21:58:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-26 21:58:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-26 21:58:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-26 21:58:07,939 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-26 21:58:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:07,939 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-26 21:58:07,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:58:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-26 21:58:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:07,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:07,950 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-26 21:58:07,950 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-26 21:58:07,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:07,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-26 21:58:07,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:07,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512065513] [2019-12-26 21:58:07,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:08,077 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-26 21:58:08,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512065513] [2019-12-26 21:58:08,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:08,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:58:08,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526214061] [2019-12-26 21:58:08,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:58:08,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:08,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:58:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:58:08,080 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-26 21:58:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:09,303 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-26 21:58:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:58:09,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:58:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:09,365 INFO L225 Difference]: With dead ends: 36233 [2019-12-26 21:58:09,365 INFO L226 Difference]: Without dead ends: 32009 [2019-12-26 21:58:09,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:58:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-26 21:58:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-26 21:58:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-26 21:58:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-26 21:58:09,730 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-26 21:58:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:09,731 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-26 21:58:09,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:58:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-26 21:58:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:09,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:09,746 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-26 21:58:09,746 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-26 21:58:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-26 21:58:09,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:09,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791108342] [2019-12-26 21:58:09,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:58:09,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791108342] [2019-12-26 21:58:09,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:09,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:58:09,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571703755] [2019-12-26 21:58:09,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:58:09,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:58:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:09,794 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-26 21:58:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:09,874 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-26 21:58:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:09,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:58:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:09,897 INFO L225 Difference]: With dead ends: 12867 [2019-12-26 21:58:09,898 INFO L226 Difference]: Without dead ends: 12867 [2019-12-26 21:58:09,898 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-26 21:58:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-26 21:58:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-26 21:58:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-26 21:58:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-26 21:58:10,096 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-26 21:58:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:10,096 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-26 21:58:10,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:58:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-26 21:58:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:10,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:10,113 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-26 21:58:10,113 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-26 21:58:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-26 21:58:10,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:10,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501922833] [2019-12-26 21:58:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:10,224 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-26 21:58:10,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501922833] [2019-12-26 21:58:10,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:10,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:58:10,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463082715] [2019-12-26 21:58:10,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:58:10,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:58:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:58:10,227 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-26 21:58:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:11,369 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-26 21:58:11,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:58:11,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:58:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:11,404 INFO L225 Difference]: With dead ends: 28791 [2019-12-26 21:58:11,404 INFO L226 Difference]: Without dead ends: 26476 [2019-12-26 21:58:11,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:58:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-26 21:58:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-26 21:58:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-26 21:58:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-26 21:58:11,668 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-26 21:58:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:11,668 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-26 21:58:11,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:58:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-26 21:58:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:58:11,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:11,681 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-26 21:58:11,681 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-26 21:58:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-26 21:58:11,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:11,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298122227] [2019-12-26 21:58:11,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:11,767 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-26 21:58:11,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298122227] [2019-12-26 21:58:11,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:11,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:58:11,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086363066] [2019-12-26 21:58:11,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:58:11,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:11,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:58:11,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:11,769 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 3 states. [2019-12-26 21:58:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:11,812 INFO L93 Difference]: Finished difference Result 8548 states and 26013 transitions. [2019-12-26 21:58:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:11,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:58:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:11,827 INFO L225 Difference]: With dead ends: 8548 [2019-12-26 21:58:11,827 INFO L226 Difference]: Without dead ends: 8548 [2019-12-26 21:58:11,828 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-26 21:58:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2019-12-26 21:58:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 8548. [2019-12-26 21:58:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8548 states. [2019-12-26 21:58:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8548 states to 8548 states and 26013 transitions. [2019-12-26 21:58:11,976 INFO L78 Accepts]: Start accepts. Automaton has 8548 states and 26013 transitions. Word has length 64 [2019-12-26 21:58:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:11,976 INFO L462 AbstractCegarLoop]: Abstraction has 8548 states and 26013 transitions. [2019-12-26 21:58:11,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:58:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8548 states and 26013 transitions. [2019-12-26 21:58:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:11,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:11,985 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-26 21:58:11,985 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-26 21:58:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 950504329, now seen corresponding path program 1 times [2019-12-26 21:58:11,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:11,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054518839] [2019-12-26 21:58:11,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:12,091 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-26 21:58:12,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054518839] [2019-12-26 21:58:12,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:12,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:58:12,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586697292] [2019-12-26 21:58:12,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:58:12,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:58:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:58:12,093 INFO L87 Difference]: Start difference. First operand 8548 states and 26013 transitions. Second operand 8 states. [2019-12-26 21:58:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:12,857 INFO L93 Difference]: Finished difference Result 15106 states and 45404 transitions. [2019-12-26 21:58:12,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:58:12,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:58:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:12,874 INFO L225 Difference]: With dead ends: 15106 [2019-12-26 21:58:12,874 INFO L226 Difference]: Without dead ends: 11359 [2019-12-26 21:58:12,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:58:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2019-12-26 21:58:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 9012. [2019-12-26 21:58:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2019-12-26 21:58:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 27166 transitions. [2019-12-26 21:58:13,031 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 27166 transitions. Word has length 65 [2019-12-26 21:58:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:13,032 INFO L462 AbstractCegarLoop]: Abstraction has 9012 states and 27166 transitions. [2019-12-26 21:58:13,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:58:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 27166 transitions. [2019-12-26 21:58:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:13,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:13,041 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-26 21:58:13,041 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-26 21:58:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash 406915929, now seen corresponding path program 2 times [2019-12-26 21:58:13,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:13,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149975523] [2019-12-26 21:58:13,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:13,168 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-26 21:58:13,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149975523] [2019-12-26 21:58:13,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:13,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:58:13,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515197232] [2019-12-26 21:58:13,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:58:13,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:58:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:58:13,170 INFO L87 Difference]: Start difference. First operand 9012 states and 27166 transitions. Second operand 9 states. [2019-12-26 21:58:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:14,145 INFO L93 Difference]: Finished difference Result 14370 states and 42744 transitions. [2019-12-26 21:58:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:58:14,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:58:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:14,164 INFO L225 Difference]: With dead ends: 14370 [2019-12-26 21:58:14,164 INFO L226 Difference]: Without dead ends: 11039 [2019-12-26 21:58:14,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:58:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11039 states. [2019-12-26 21:58:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11039 to 8852. [2019-12-26 21:58:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8852 states. [2019-12-26 21:58:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8852 states to 8852 states and 26638 transitions. [2019-12-26 21:58:14,395 INFO L78 Accepts]: Start accepts. Automaton has 8852 states and 26638 transitions. Word has length 65 [2019-12-26 21:58:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:14,395 INFO L462 AbstractCegarLoop]: Abstraction has 8852 states and 26638 transitions. [2019-12-26 21:58:14,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:58:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 8852 states and 26638 transitions. [2019-12-26 21:58:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:14,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:14,408 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-26 21:58:14,409 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-26 21:58:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:14,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1792236963, now seen corresponding path program 3 times [2019-12-26 21:58:14,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:14,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921147066] [2019-12-26 21:58:14,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:14,601 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-26 21:58:14,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921147066] [2019-12-26 21:58:14,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:14,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:58:14,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681096387] [2019-12-26 21:58:14,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:58:14,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:58:14,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:58:14,604 INFO L87 Difference]: Start difference. First operand 8852 states and 26638 transitions. Second operand 10 states. [2019-12-26 21:58:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:16,273 INFO L93 Difference]: Finished difference Result 18176 states and 53149 transitions. [2019-12-26 21:58:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:58:16,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-26 21:58:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:16,296 INFO L225 Difference]: With dead ends: 18176 [2019-12-26 21:58:16,296 INFO L226 Difference]: Without dead ends: 17936 [2019-12-26 21:58:16,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:58:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17936 states. [2019-12-26 21:58:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17936 to 13739. [2019-12-26 21:58:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13739 states. [2019-12-26 21:58:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13739 states to 13739 states and 40385 transitions. [2019-12-26 21:58:16,537 INFO L78 Accepts]: Start accepts. Automaton has 13739 states and 40385 transitions. Word has length 65 [2019-12-26 21:58:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:16,537 INFO L462 AbstractCegarLoop]: Abstraction has 13739 states and 40385 transitions. [2019-12-26 21:58:16,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:58:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13739 states and 40385 transitions. [2019-12-26 21:58:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:16,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:16,555 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-26 21:58:16,556 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-26 21:58:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2042131627, now seen corresponding path program 4 times [2019-12-26 21:58:16,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:16,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549553390] [2019-12-26 21:58:16,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:16,650 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-26 21:58:16,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549553390] [2019-12-26 21:58:16,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:16,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:58:16,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980918995] [2019-12-26 21:58:16,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:58:16,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:58:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:58:16,652 INFO L87 Difference]: Start difference. First operand 13739 states and 40385 transitions. Second operand 7 states. [2019-12-26 21:58:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:17,507 INFO L93 Difference]: Finished difference Result 24335 states and 69905 transitions. [2019-12-26 21:58:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:58:17,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:58:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:17,537 INFO L225 Difference]: With dead ends: 24335 [2019-12-26 21:58:17,537 INFO L226 Difference]: Without dead ends: 24167 [2019-12-26 21:58:17,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:58:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24167 states. [2019-12-26 21:58:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24167 to 16933. [2019-12-26 21:58:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16933 states. [2019-12-26 21:58:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16933 states to 16933 states and 49369 transitions. [2019-12-26 21:58:17,832 INFO L78 Accepts]: Start accepts. Automaton has 16933 states and 49369 transitions. Word has length 65 [2019-12-26 21:58:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:17,832 INFO L462 AbstractCegarLoop]: Abstraction has 16933 states and 49369 transitions. [2019-12-26 21:58:17,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:58:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16933 states and 49369 transitions. [2019-12-26 21:58:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:17,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:17,848 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-26 21:58:17,848 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-26 21:58:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash -505523827, now seen corresponding path program 5 times [2019-12-26 21:58:17,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:17,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238833492] [2019-12-26 21:58:17,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:18,029 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-26 21:58:18,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238833492] [2019-12-26 21:58:18,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:18,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:58:18,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417178420] [2019-12-26 21:58:18,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:58:18,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:18,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:58:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:58:18,032 INFO L87 Difference]: Start difference. First operand 16933 states and 49369 transitions. Second operand 11 states. [2019-12-26 21:58:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:19,701 INFO L93 Difference]: Finished difference Result 23420 states and 67432 transitions. [2019-12-26 21:58:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:58:19,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 21:58:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:19,735 INFO L225 Difference]: With dead ends: 23420 [2019-12-26 21:58:19,736 INFO L226 Difference]: Without dead ends: 23420 [2019-12-26 21:58:19,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:58:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23420 states. [2019-12-26 21:58:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23420 to 17005. [2019-12-26 21:58:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17005 states. [2019-12-26 21:58:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17005 states to 17005 states and 49569 transitions. [2019-12-26 21:58:20,038 INFO L78 Accepts]: Start accepts. Automaton has 17005 states and 49569 transitions. Word has length 65 [2019-12-26 21:58:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:20,038 INFO L462 AbstractCegarLoop]: Abstraction has 17005 states and 49569 transitions. [2019-12-26 21:58:20,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:58:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17005 states and 49569 transitions. [2019-12-26 21:58:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:20,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:20,055 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-26 21:58:20,055 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-26 21:58:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1882026893, now seen corresponding path program 6 times [2019-12-26 21:58:20,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:20,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226530101] [2019-12-26 21:58:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:20,239 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-26 21:58:20,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226530101] [2019-12-26 21:58:20,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:20,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:58:20,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643087641] [2019-12-26 21:58:20,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:58:20,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:58:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:58:20,241 INFO L87 Difference]: Start difference. First operand 17005 states and 49569 transitions. Second operand 11 states. [2019-12-26 21:58:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:22,441 INFO L93 Difference]: Finished difference Result 23888 states and 68662 transitions. [2019-12-26 21:58:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:58:22,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 21:58:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:22,472 INFO L225 Difference]: With dead ends: 23888 [2019-12-26 21:58:22,472 INFO L226 Difference]: Without dead ends: 23888 [2019-12-26 21:58:22,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:58:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23888 states. [2019-12-26 21:58:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23888 to 16165. [2019-12-26 21:58:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16165 states. [2019-12-26 21:58:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16165 states to 16165 states and 47247 transitions. [2019-12-26 21:58:22,773 INFO L78 Accepts]: Start accepts. Automaton has 16165 states and 47247 transitions. Word has length 65 [2019-12-26 21:58:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:22,773 INFO L462 AbstractCegarLoop]: Abstraction has 16165 states and 47247 transitions. [2019-12-26 21:58:22,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:58:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 16165 states and 47247 transitions. [2019-12-26 21:58:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:22,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:22,794 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-26 21:58:22,794 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-26 21:58:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1887248817, now seen corresponding path program 7 times [2019-12-26 21:58:22,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:22,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630049011] [2019-12-26 21:58:22,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:22,856 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-26 21:58:22,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630049011] [2019-12-26 21:58:22,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:22,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:58:22,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343881224] [2019-12-26 21:58:22,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:58:22,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:22,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:58:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:58:22,859 INFO L87 Difference]: Start difference. First operand 16165 states and 47247 transitions. Second operand 5 states. [2019-12-26 21:58:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:23,166 INFO L93 Difference]: Finished difference Result 18069 states and 52531 transitions. [2019-12-26 21:58:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:58:23,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 21:58:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:23,190 INFO L225 Difference]: With dead ends: 18069 [2019-12-26 21:58:23,190 INFO L226 Difference]: Without dead ends: 18069 [2019-12-26 21:58:23,190 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-26 21:58:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18069 states. [2019-12-26 21:58:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18069 to 16852. [2019-12-26 21:58:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2019-12-26 21:58:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 49238 transitions. [2019-12-26 21:58:23,584 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 49238 transitions. Word has length 65 [2019-12-26 21:58:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:23,584 INFO L462 AbstractCegarLoop]: Abstraction has 16852 states and 49238 transitions. [2019-12-26 21:58:23,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:58:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 49238 transitions. [2019-12-26 21:58:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:58:23,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:23,602 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-26 21:58:23,602 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-26 21:58:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1895624641, now seen corresponding path program 8 times [2019-12-26 21:58:23,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:23,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249062030] [2019-12-26 21:58:23,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:23,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-26 21:58:23,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249062030] [2019-12-26 21:58:23,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:23,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:58:23,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108181606] [2019-12-26 21:58:23,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:58:23,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:58:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:23,691 INFO L87 Difference]: Start difference. First operand 16852 states and 49238 transitions. Second operand 3 states. [2019-12-26 21:58:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:23,760 INFO L93 Difference]: Finished difference Result 16852 states and 49237 transitions. [2019-12-26 21:58:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:23,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:58:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:23,787 INFO L225 Difference]: With dead ends: 16852 [2019-12-26 21:58:23,787 INFO L226 Difference]: Without dead ends: 16852 [2019-12-26 21:58:23,788 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-26 21:58:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16852 states. [2019-12-26 21:58:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16852 to 15231. [2019-12-26 21:58:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15231 states. [2019-12-26 21:58:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15231 states to 15231 states and 44738 transitions. [2019-12-26 21:58:24,044 INFO L78 Accepts]: Start accepts. Automaton has 15231 states and 44738 transitions. Word has length 65 [2019-12-26 21:58:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:24,045 INFO L462 AbstractCegarLoop]: Abstraction has 15231 states and 44738 transitions. [2019-12-26 21:58:24,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:58:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15231 states and 44738 transitions. [2019-12-26 21:58:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:24,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:24,060 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-26 21:58:24,060 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-26 21:58:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 1 times [2019-12-26 21:58:24,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:24,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088009679] [2019-12-26 21:58:24,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:24,313 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-26 21:58:24,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088009679] [2019-12-26 21:58:24,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:24,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:58:24,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998336183] [2019-12-26 21:58:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 21:58:24,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 21:58:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:58:24,315 INFO L87 Difference]: Start difference. First operand 15231 states and 44738 transitions. Second operand 13 states. [2019-12-26 21:58:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:25,676 INFO L93 Difference]: Finished difference Result 21742 states and 63142 transitions. [2019-12-26 21:58:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:58:25,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-26 21:58:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:25,701 INFO L225 Difference]: With dead ends: 21742 [2019-12-26 21:58:25,701 INFO L226 Difference]: Without dead ends: 18334 [2019-12-26 21:58:25,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:58:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18334 states. [2019-12-26 21:58:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18334 to 15396. [2019-12-26 21:58:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15396 states. [2019-12-26 21:58:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15396 states to 15396 states and 45081 transitions. [2019-12-26 21:58:25,953 INFO L78 Accepts]: Start accepts. Automaton has 15396 states and 45081 transitions. Word has length 66 [2019-12-26 21:58:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:25,953 INFO L462 AbstractCegarLoop]: Abstraction has 15396 states and 45081 transitions. [2019-12-26 21:58:25,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 21:58:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15396 states and 45081 transitions. [2019-12-26 21:58:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:25,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:25,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:58:25,968 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-26 21:58:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -667839678, now seen corresponding path program 2 times [2019-12-26 21:58:25,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:25,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496446360] [2019-12-26 21:58:25,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:26,201 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-26 21:58:26,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496446360] [2019-12-26 21:58:26,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:26,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:58:26,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397234895] [2019-12-26 21:58:26,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:58:26,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:26,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:58:26,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:58:26,203 INFO L87 Difference]: Start difference. First operand 15396 states and 45081 transitions. Second operand 12 states. [2019-12-26 21:58:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:27,857 INFO L93 Difference]: Finished difference Result 22753 states and 65384 transitions. [2019-12-26 21:58:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:58:27,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:58:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:27,882 INFO L225 Difference]: With dead ends: 22753 [2019-12-26 21:58:27,882 INFO L226 Difference]: Without dead ends: 18971 [2019-12-26 21:58:27,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:58:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2019-12-26 21:58:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 15542. [2019-12-26 21:58:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15542 states. [2019-12-26 21:58:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15542 states to 15542 states and 45266 transitions. [2019-12-26 21:58:28,147 INFO L78 Accepts]: Start accepts. Automaton has 15542 states and 45266 transitions. Word has length 66 [2019-12-26 21:58:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:28,147 INFO L462 AbstractCegarLoop]: Abstraction has 15542 states and 45266 transitions. [2019-12-26 21:58:28,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:58:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15542 states and 45266 transitions. [2019-12-26 21:58:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:28,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:28,162 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-26 21:58:28,163 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-26 21:58:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash 411152318, now seen corresponding path program 3 times [2019-12-26 21:58:28,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:28,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118255139] [2019-12-26 21:58:28,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:28,785 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-26 21:58:28,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118255139] [2019-12-26 21:58:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:28,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 21:58:28,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827341473] [2019-12-26 21:58:28,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:58:28,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:58:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:58:28,788 INFO L87 Difference]: Start difference. First operand 15542 states and 45266 transitions. Second operand 16 states. [2019-12-26 21:58:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:30,904 INFO L93 Difference]: Finished difference Result 18675 states and 53544 transitions. [2019-12-26 21:58:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:58:30,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 21:58:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:30,928 INFO L225 Difference]: With dead ends: 18675 [2019-12-26 21:58:30,928 INFO L226 Difference]: Without dead ends: 17736 [2019-12-26 21:58:30,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:58:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17736 states. [2019-12-26 21:58:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17736 to 15574. [2019-12-26 21:58:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15574 states. [2019-12-26 21:58:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15574 states to 15574 states and 45347 transitions. [2019-12-26 21:58:31,170 INFO L78 Accepts]: Start accepts. Automaton has 15574 states and 45347 transitions. Word has length 66 [2019-12-26 21:58:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:31,170 INFO L462 AbstractCegarLoop]: Abstraction has 15574 states and 45347 transitions. [2019-12-26 21:58:31,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:58:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15574 states and 45347 transitions. [2019-12-26 21:58:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:31,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:31,189 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-26 21:58:31,189 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-26 21:58:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1321821776, now seen corresponding path program 4 times [2019-12-26 21:58:31,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:31,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43283555] [2019-12-26 21:58:31,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:32,074 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-26 21:58:32,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43283555] [2019-12-26 21:58:32,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:32,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 21:58:32,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353695057] [2019-12-26 21:58:32,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 21:58:32,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:32,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 21:58:32,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:58:32,075 INFO L87 Difference]: Start difference. First operand 15574 states and 45347 transitions. Second operand 21 states. [2019-12-26 21:58:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:35,022 INFO L93 Difference]: Finished difference Result 18120 states and 51999 transitions. [2019-12-26 21:58:35,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:58:35,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-26 21:58:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:35,046 INFO L225 Difference]: With dead ends: 18120 [2019-12-26 21:58:35,047 INFO L226 Difference]: Without dead ends: 17441 [2019-12-26 21:58:35,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 21:58:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2019-12-26 21:58:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 15594. [2019-12-26 21:58:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-26 21:58:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 45392 transitions. [2019-12-26 21:58:35,288 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 45392 transitions. Word has length 66 [2019-12-26 21:58:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:35,288 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 45392 transitions. [2019-12-26 21:58:35,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 21:58:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 45392 transitions. [2019-12-26 21:58:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:35,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:35,304 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-26 21:58:35,304 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-26 21:58:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash -330419168, now seen corresponding path program 5 times [2019-12-26 21:58:35,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:35,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857860824] [2019-12-26 21:58:35,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:35,635 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-26 21:58:35,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857860824] [2019-12-26 21:58:35,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:35,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 21:58:35,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047789037] [2019-12-26 21:58:35,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 21:58:35,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:35,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 21:58:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:58:35,638 INFO L87 Difference]: Start difference. First operand 15594 states and 45392 transitions. Second operand 15 states. [2019-12-26 21:58:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:37,539 INFO L93 Difference]: Finished difference Result 18351 states and 52655 transitions. [2019-12-26 21:58:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:58:37,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-26 21:58:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:37,562 INFO L225 Difference]: With dead ends: 18351 [2019-12-26 21:58:37,562 INFO L226 Difference]: Without dead ends: 17164 [2019-12-26 21:58:37,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:58:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states. [2019-12-26 21:58:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 15550. [2019-12-26 21:58:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15550 states. [2019-12-26 21:58:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15550 states to 15550 states and 45280 transitions. [2019-12-26 21:58:37,961 INFO L78 Accepts]: Start accepts. Automaton has 15550 states and 45280 transitions. Word has length 66 [2019-12-26 21:58:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:37,961 INFO L462 AbstractCegarLoop]: Abstraction has 15550 states and 45280 transitions. [2019-12-26 21:58:37,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 21:58:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15550 states and 45280 transitions. [2019-12-26 21:58:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:37,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:37,976 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-26 21:58:37,976 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-26 21:58:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1160165832, now seen corresponding path program 6 times [2019-12-26 21:58:37,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:37,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785608834] [2019-12-26 21:58:37,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:58:38,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785608834] [2019-12-26 21:58:38,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:38,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:58:38,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723541302] [2019-12-26 21:58:38,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:58:38,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:58:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:58:38,162 INFO L87 Difference]: Start difference. First operand 15550 states and 45280 transitions. Second operand 10 states. [2019-12-26 21:58:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:40,063 INFO L93 Difference]: Finished difference Result 28262 states and 80767 transitions. [2019-12-26 21:58:40,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:58:40,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:58:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:40,099 INFO L225 Difference]: With dead ends: 28262 [2019-12-26 21:58:40,100 INFO L226 Difference]: Without dead ends: 27854 [2019-12-26 21:58:40,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:58:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27854 states. [2019-12-26 21:58:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27854 to 17224. [2019-12-26 21:58:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17224 states. [2019-12-26 21:58:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17224 states to 17224 states and 49962 transitions. [2019-12-26 21:58:40,421 INFO L78 Accepts]: Start accepts. Automaton has 17224 states and 49962 transitions. Word has length 66 [2019-12-26 21:58:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:40,421 INFO L462 AbstractCegarLoop]: Abstraction has 17224 states and 49962 transitions. [2019-12-26 21:58:40,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:58:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17224 states and 49962 transitions. [2019-12-26 21:58:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:40,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:40,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:58:40,438 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-26 21:58:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 7 times [2019-12-26 21:58:40,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:40,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836643379] [2019-12-26 21:58:40,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:40,579 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-26 21:58:40,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836643379] [2019-12-26 21:58:40,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:40,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:58:40,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001776600] [2019-12-26 21:58:40,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:58:40,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:58:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:58:40,581 INFO L87 Difference]: Start difference. First operand 17224 states and 49962 transitions. Second operand 10 states. [2019-12-26 21:58:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:42,960 INFO L93 Difference]: Finished difference Result 29264 states and 83155 transitions. [2019-12-26 21:58:42,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:58:42,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:58:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:42,998 INFO L225 Difference]: With dead ends: 29264 [2019-12-26 21:58:42,998 INFO L226 Difference]: Without dead ends: 29264 [2019-12-26 21:58:42,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:58:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29264 states. [2019-12-26 21:58:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29264 to 14860. [2019-12-26 21:58:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-12-26 21:58:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 43438 transitions. [2019-12-26 21:58:43,324 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 43438 transitions. Word has length 66 [2019-12-26 21:58:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:43,324 INFO L462 AbstractCegarLoop]: Abstraction has 14860 states and 43438 transitions. [2019-12-26 21:58:43,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:58:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 43438 transitions. [2019-12-26 21:58:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:58:43,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:43,339 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-26 21:58:43,339 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-26 21:58:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:43,339 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 8 times [2019-12-26 21:58:43,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:43,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530854369] [2019-12-26 21:58:43,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:43,429 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-26 21:58:43,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530854369] [2019-12-26 21:58:43,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:43,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:58:43,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57974256] [2019-12-26 21:58:43,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:58:43,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:58:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:58:43,431 INFO L87 Difference]: Start difference. First operand 14860 states and 43438 transitions. Second operand 4 states. [2019-12-26 21:58:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:43,539 INFO L93 Difference]: Finished difference Result 16888 states and 49601 transitions. [2019-12-26 21:58:43,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:43,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:58:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:43,560 INFO L225 Difference]: With dead ends: 16888 [2019-12-26 21:58:43,560 INFO L226 Difference]: Without dead ends: 16888 [2019-12-26 21:58:43,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:58:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16888 states. [2019-12-26 21:58:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16888 to 13645. [2019-12-26 21:58:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13645 states. [2019-12-26 21:58:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13645 states to 13645 states and 40314 transitions. [2019-12-26 21:58:43,791 INFO L78 Accepts]: Start accepts. Automaton has 13645 states and 40314 transitions. Word has length 66 [2019-12-26 21:58:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:43,792 INFO L462 AbstractCegarLoop]: Abstraction has 13645 states and 40314 transitions. [2019-12-26 21:58:43,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:58:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13645 states and 40314 transitions. [2019-12-26 21:58:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:58:43,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:43,806 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-26 21:58:43,806 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-26 21:58:43,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:43,806 INFO L82 PathProgramCache]: Analyzing trace with hash 57333696, now seen corresponding path program 1 times [2019-12-26 21:58:43,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:43,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147607044] [2019-12-26 21:58:43,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:44,546 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-26 21:58:44,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147607044] [2019-12-26 21:58:44,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:44,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-26 21:58:44,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755709336] [2019-12-26 21:58:44,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 21:58:44,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:44,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 21:58:44,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:58:44,548 INFO L87 Difference]: Start difference. First operand 13645 states and 40314 transitions. Second operand 21 states. [2019-12-26 21:58:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:49,322 INFO L93 Difference]: Finished difference Result 20347 states and 58555 transitions. [2019-12-26 21:58:49,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-26 21:58:49,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-26 21:58:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:49,347 INFO L225 Difference]: With dead ends: 20347 [2019-12-26 21:58:49,348 INFO L226 Difference]: Without dead ends: 19352 [2019-12-26 21:58:49,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=383, Invalid=2697, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 21:58:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19352 states. [2019-12-26 21:58:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19352 to 13649. [2019-12-26 21:58:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13649 states. [2019-12-26 21:58:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13649 states to 13649 states and 40322 transitions. [2019-12-26 21:58:49,599 INFO L78 Accepts]: Start accepts. Automaton has 13649 states and 40322 transitions. Word has length 67 [2019-12-26 21:58:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:49,599 INFO L462 AbstractCegarLoop]: Abstraction has 13649 states and 40322 transitions. [2019-12-26 21:58:49,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 21:58:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13649 states and 40322 transitions. [2019-12-26 21:58:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:58:49,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:49,615 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-26 21:58:49,615 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:58:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:49,616 INFO L82 PathProgramCache]: Analyzing trace with hash 304777142, now seen corresponding path program 2 times [2019-12-26 21:58:49,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:49,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515705533] [2019-12-26 21:58:49,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:50,209 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-26 21:58:50,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515705533] [2019-12-26 21:58:50,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:50,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 21:58:50,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595772883] [2019-12-26 21:58:50,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 21:58:50,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 21:58:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:58:50,211 INFO L87 Difference]: Start difference. First operand 13649 states and 40322 transitions. Second operand 20 states. [2019-12-26 21:58:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:54,881 INFO L93 Difference]: Finished difference Result 19853 states and 57040 transitions. [2019-12-26 21:58:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-26 21:58:54,881 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-26 21:58:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:54,906 INFO L225 Difference]: With dead ends: 19853 [2019-12-26 21:58:54,906 INFO L226 Difference]: Without dead ends: 17913 [2019-12-26 21:58:54,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=477, Invalid=3555, Unknown=0, NotChecked=0, Total=4032 [2019-12-26 21:58:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17913 states. [2019-12-26 21:58:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17913 to 13794. [2019-12-26 21:58:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13794 states. [2019-12-26 21:58:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13794 states to 13794 states and 40647 transitions. [2019-12-26 21:58:55,311 INFO L78 Accepts]: Start accepts. Automaton has 13794 states and 40647 transitions. Word has length 67 [2019-12-26 21:58:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:55,311 INFO L462 AbstractCegarLoop]: Abstraction has 13794 states and 40647 transitions. [2019-12-26 21:58:55,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 21:58:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13794 states and 40647 transitions. [2019-12-26 21:58:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:58:55,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:55,328 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-26 21:58:55,328 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:58:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 3 times [2019-12-26 21:58:55,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:55,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69303837] [2019-12-26 21:58:55,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:55,598 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-26 21:58:55,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69303837] [2019-12-26 21:58:55,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:55,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:58:55,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794177410] [2019-12-26 21:58:55,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:58:55,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:55,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:58:55,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:58:55,600 INFO L87 Difference]: Start difference. First operand 13794 states and 40647 transitions. Second operand 12 states. [2019-12-26 21:58:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:56,965 INFO L93 Difference]: Finished difference Result 17420 states and 50621 transitions. [2019-12-26 21:58:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:58:56,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:58:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:56,989 INFO L225 Difference]: With dead ends: 17420 [2019-12-26 21:58:56,989 INFO L226 Difference]: Without dead ends: 16481 [2019-12-26 21:58:56,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:58:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16481 states. [2019-12-26 21:58:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16481 to 13646. [2019-12-26 21:58:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13646 states. [2019-12-26 21:58:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13646 states to 13646 states and 40267 transitions. [2019-12-26 21:58:57,220 INFO L78 Accepts]: Start accepts. Automaton has 13646 states and 40267 transitions. Word has length 67 [2019-12-26 21:58:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:57,220 INFO L462 AbstractCegarLoop]: Abstraction has 13646 states and 40267 transitions. [2019-12-26 21:58:57,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:58:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13646 states and 40267 transitions. [2019-12-26 21:58:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:58:57,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:57,235 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-26 21:58:57,235 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:58:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -680764638, now seen corresponding path program 4 times [2019-12-26 21:58:57,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:57,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176293255] [2019-12-26 21:58:57,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:57,513 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-26 21:58:57,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176293255] [2019-12-26 21:58:57,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:57,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:58:57,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709627459] [2019-12-26 21:58:57,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 21:58:57,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 21:58:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:58:57,515 INFO L87 Difference]: Start difference. First operand 13646 states and 40267 transitions. Second operand 14 states. [2019-12-26 21:58:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:59,230 INFO L93 Difference]: Finished difference Result 15766 states and 45911 transitions. [2019-12-26 21:58:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:58:59,230 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-26 21:58:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:59,251 INFO L225 Difference]: With dead ends: 15766 [2019-12-26 21:58:59,251 INFO L226 Difference]: Without dead ends: 14771 [2019-12-26 21:58:59,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:58:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14771 states. [2019-12-26 21:58:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14771 to 13638. [2019-12-26 21:58:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13638 states. [2019-12-26 21:58:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13638 states to 13638 states and 40247 transitions. [2019-12-26 21:58:59,467 INFO L78 Accepts]: Start accepts. Automaton has 13638 states and 40247 transitions. Word has length 67 [2019-12-26 21:58:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:59,467 INFO L462 AbstractCegarLoop]: Abstraction has 13638 states and 40247 transitions. [2019-12-26 21:58:59,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 21:58:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13638 states and 40247 transitions. [2019-12-26 21:58:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:58:59,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:59,482 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-26 21:58:59,482 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:58:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash -433321192, now seen corresponding path program 5 times [2019-12-26 21:58:59,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:59,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628147973] [2019-12-26 21:58:59,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:00,122 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-26 21:59:00,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628147973] [2019-12-26 21:59:00,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:00,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-26 21:59:00,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375696381] [2019-12-26 21:59:00,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 21:59:00,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:00,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 21:59:00,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:59:00,124 INFO L87 Difference]: Start difference. First operand 13638 states and 40247 transitions. Second operand 21 states. [2019-12-26 21:59:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:06,053 INFO L93 Difference]: Finished difference Result 18820 states and 54093 transitions. [2019-12-26 21:59:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-26 21:59:06,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-26 21:59:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:06,080 INFO L225 Difference]: With dead ends: 18820 [2019-12-26 21:59:06,081 INFO L226 Difference]: Without dead ends: 18113 [2019-12-26 21:59:06,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=484, Invalid=3298, Unknown=0, NotChecked=0, Total=3782 [2019-12-26 21:59:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18113 states. [2019-12-26 21:59:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18113 to 13661. [2019-12-26 21:59:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13661 states. [2019-12-26 21:59:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13661 states to 13661 states and 40304 transitions. [2019-12-26 21:59:06,312 INFO L78 Accepts]: Start accepts. Automaton has 13661 states and 40304 transitions. Word has length 67 [2019-12-26 21:59:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:06,312 INFO L462 AbstractCegarLoop]: Abstraction has 13661 states and 40304 transitions. [2019-12-26 21:59:06,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 21:59:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13661 states and 40304 transitions. [2019-12-26 21:59:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:06,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:06,326 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-26 21:59:06,326 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1075131734, now seen corresponding path program 6 times [2019-12-26 21:59:06,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:06,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167602358] [2019-12-26 21:59:06,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:06,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-26 21:59:06,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167602358] [2019-12-26 21:59:06,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:06,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 21:59:06,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438598112] [2019-12-26 21:59:06,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 21:59:06,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 21:59:06,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:59:06,919 INFO L87 Difference]: Start difference. First operand 13661 states and 40304 transitions. Second operand 20 states. [2019-12-26 21:59:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:11,363 INFO L93 Difference]: Finished difference Result 19247 states and 55376 transitions. [2019-12-26 21:59:11,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-26 21:59:11,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-26 21:59:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:11,387 INFO L225 Difference]: With dead ends: 19247 [2019-12-26 21:59:11,387 INFO L226 Difference]: Without dead ends: 17827 [2019-12-26 21:59:11,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=447, Invalid=2975, Unknown=0, NotChecked=0, Total=3422 [2019-12-26 21:59:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17827 states. [2019-12-26 21:59:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17827 to 13699. [2019-12-26 21:59:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13699 states. [2019-12-26 21:59:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13699 states to 13699 states and 40403 transitions. [2019-12-26 21:59:11,619 INFO L78 Accepts]: Start accepts. Automaton has 13699 states and 40403 transitions. Word has length 67 [2019-12-26 21:59:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:11,620 INFO L462 AbstractCegarLoop]: Abstraction has 13699 states and 40403 transitions. [2019-12-26 21:59:11,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 21:59:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13699 states and 40403 transitions. [2019-12-26 21:59:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:11,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:11,633 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-26 21:59:11,633 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1155222906, now seen corresponding path program 7 times [2019-12-26 21:59:11,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:11,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210845250] [2019-12-26 21:59:11,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:11,925 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-26 21:59:11,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210845250] [2019-12-26 21:59:11,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:11,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 21:59:11,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499889026] [2019-12-26 21:59:11,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:59:11,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:59:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:59:11,927 INFO L87 Difference]: Start difference. First operand 13699 states and 40403 transitions. Second operand 16 states. [2019-12-26 21:59:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:13,912 INFO L93 Difference]: Finished difference Result 18119 states and 52666 transitions. [2019-12-26 21:59:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:59:13,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 21:59:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:13,933 INFO L225 Difference]: With dead ends: 18119 [2019-12-26 21:59:13,934 INFO L226 Difference]: Without dead ends: 16202 [2019-12-26 21:59:13,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 21:59:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16202 states. [2019-12-26 21:59:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16202 to 13075. [2019-12-26 21:59:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13075 states. [2019-12-26 21:59:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13075 states to 13075 states and 38876 transitions. [2019-12-26 21:59:14,316 INFO L78 Accepts]: Start accepts. Automaton has 13075 states and 38876 transitions. Word has length 67 [2019-12-26 21:59:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:14,316 INFO L462 AbstractCegarLoop]: Abstraction has 13075 states and 38876 transitions. [2019-12-26 21:59:14,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:59:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 13075 states and 38876 transitions. [2019-12-26 21:59:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:14,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:14,330 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-26 21:59:14,330 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1273938143, now seen corresponding path program 1 times [2019-12-26 21:59:14,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:14,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908526206] [2019-12-26 21:59:14,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:14,454 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-26 21:59:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908526206] [2019-12-26 21:59:14,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:14,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:59:14,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553196806] [2019-12-26 21:59:14,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:14,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:14,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:14,455 INFO L87 Difference]: Start difference. First operand 13075 states and 38876 transitions. Second operand 7 states. [2019-12-26 21:59:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:14,877 INFO L93 Difference]: Finished difference Result 12033 states and 35290 transitions. [2019-12-26 21:59:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:59:14,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-26 21:59:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:14,894 INFO L225 Difference]: With dead ends: 12033 [2019-12-26 21:59:14,894 INFO L226 Difference]: Without dead ends: 12030 [2019-12-26 21:59:14,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:59:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12030 states. [2019-12-26 21:59:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12030 to 11457. [2019-12-26 21:59:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11457 states. [2019-12-26 21:59:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11457 states to 11457 states and 33691 transitions. [2019-12-26 21:59:15,063 INFO L78 Accepts]: Start accepts. Automaton has 11457 states and 33691 transitions. Word has length 67 [2019-12-26 21:59:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:15,063 INFO L462 AbstractCegarLoop]: Abstraction has 11457 states and 33691 transitions. [2019-12-26 21:59:15,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11457 states and 33691 transitions. [2019-12-26 21:59:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:15,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:15,074 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-26 21:59:15,074 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1494433381, now seen corresponding path program 2 times [2019-12-26 21:59:15,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:15,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948225825] [2019-12-26 21:59:15,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:15,205 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-26 21:59:15,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948225825] [2019-12-26 21:59:15,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:15,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:59:15,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681985722] [2019-12-26 21:59:15,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:59:15,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:15,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:59:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:59:15,207 INFO L87 Difference]: Start difference. First operand 11457 states and 33691 transitions. Second operand 10 states. [2019-12-26 21:59:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:15,836 INFO L93 Difference]: Finished difference Result 14658 states and 42725 transitions. [2019-12-26 21:59:15,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 21:59:15,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:59:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:15,855 INFO L225 Difference]: With dead ends: 14658 [2019-12-26 21:59:15,855 INFO L226 Difference]: Without dead ends: 13839 [2019-12-26 21:59:15,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:59:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2019-12-26 21:59:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 11393. [2019-12-26 21:59:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11393 states. [2019-12-26 21:59:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11393 states to 11393 states and 33535 transitions. [2019-12-26 21:59:16,043 INFO L78 Accepts]: Start accepts. Automaton has 11393 states and 33535 transitions. Word has length 67 [2019-12-26 21:59:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:16,044 INFO L462 AbstractCegarLoop]: Abstraction has 11393 states and 33535 transitions. [2019-12-26 21:59:16,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:59:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11393 states and 33535 transitions. [2019-12-26 21:59:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:16,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:16,056 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-26 21:59:16,056 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 8 times [2019-12-26 21:59:16,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:16,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559881911] [2019-12-26 21:59:16,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:59:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:59:16,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:59:16,190 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:59:16,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t633~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t633~0.base_24|) |v_ULTIMATE.start_main_~#t633~0.offset_19| 0)) |v_#memory_int_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t633~0.base_24|)) (= |v_#NULL.offset_6| 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t633~0.base_24| 1)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t633~0.base_24|) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t633~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= |v_ULTIMATE.start_main_~#t633~0.offset_19| 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_26|, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_~#t633~0.base=|v_ULTIMATE.start_main_~#t633~0.base_24|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_19|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t633~0.offset=|v_ULTIMATE.start_main_~#t633~0.offset_19|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t635~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t635~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t634~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t633~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t634~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t633~0.offset] because there is no mapped edge [2019-12-26 21:59:16,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t634~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t634~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t634~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t634~0.base_10|) |v_ULTIMATE.start_main_~#t634~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t634~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t634~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t634~0.base=|v_ULTIMATE.start_main_~#t634~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t634~0.offset=|v_ULTIMATE.start_main_~#t634~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t634~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t634~0.offset] because there is no mapped edge [2019-12-26 21:59:16,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t635~0.base_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t635~0.base_13|)) (= |v_ULTIMATE.start_main_~#t635~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t635~0.base_13|) |v_ULTIMATE.start_main_~#t635~0.offset_11| 2)) |v_#memory_int_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t635~0.base_13| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t635~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t635~0.base=|v_ULTIMATE.start_main_~#t635~0.base_13|, ULTIMATE.start_main_~#t635~0.offset=|v_ULTIMATE.start_main_~#t635~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t635~0.base, ULTIMATE.start_main_~#t635~0.offset] because there is no mapped edge [2019-12-26 21:59:16,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:59:16,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In2071676464 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In2071676464 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out2071676464| ~a~0_In2071676464) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out2071676464| ~a$w_buff1~0_In2071676464) (not .cse1)))) InVars {~a~0=~a~0_In2071676464, ~a$w_buff1~0=~a$w_buff1~0_In2071676464, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2071676464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2071676464} OutVars{~a~0=~a~0_In2071676464, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2071676464|, ~a$w_buff1~0=~a$w_buff1~0_In2071676464, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2071676464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2071676464} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:59:16,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In971447835 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In971447835 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out971447835|) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out971447835| ~a$w_buff0_used~0_In971447835) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In971447835, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In971447835} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out971447835|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971447835, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In971447835} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:59:16,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In2110532794 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2110532794 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In2110532794 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In2110532794 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out2110532794| ~a$w_buff1_used~0_In2110532794) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out2110532794| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2110532794, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2110532794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2110532794} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2110532794|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2110532794, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2110532794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2110532794} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:59:16,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-293296695 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-293296695 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-293296695 ~a$r_buff0_thd1~0_In-293296695)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out-293296695 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-293296695, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-293296695} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-293296695|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-293296695, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-293296695} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:59:16,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1082281405 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1082281405 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1082281405 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1082281405 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1082281405| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out1082281405| ~a$r_buff1_thd1~0_In1082281405) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1082281405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1082281405} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1082281405|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1082281405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1082281405} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:59:16,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:59:16,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1113140487 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1113140487| |P2Thread1of1ForFork0_#t~ite20_Out1113140487|) (= |P2Thread1of1ForFork0_#t~ite21_Out1113140487| ~a$w_buff0~0_In1113140487) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1113140487 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1113140487 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1113140487 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1113140487 256))))) (= ~a$w_buff0~0_In1113140487 |P2Thread1of1ForFork0_#t~ite20_Out1113140487|) (= |P2Thread1of1ForFork0_#t~ite21_Out1113140487| |P2Thread1of1ForFork0_#t~ite20_Out1113140487|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1113140487, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1113140487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1113140487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1113140487, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1113140487, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1113140487|, ~weak$$choice2~0=~weak$$choice2~0_In1113140487} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1113140487|, ~a$w_buff0~0=~a$w_buff0~0_In1113140487, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1113140487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1113140487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1113140487, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1113140487|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1113140487, ~weak$$choice2~0=~weak$$choice2~0_In1113140487} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:59:16,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1589963394 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1589963394 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1589963394 256))) (= (mod ~a$w_buff0_used~0_In1589963394 256) 0) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In1589963394 256))))) (= |P2Thread1of1ForFork0_#t~ite26_Out1589963394| ~a$w_buff0_used~0_In1589963394) (= |P2Thread1of1ForFork0_#t~ite26_Out1589963394| |P2Thread1of1ForFork0_#t~ite27_Out1589963394|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In1589963394| |P2Thread1of1ForFork0_#t~ite26_Out1589963394|) (= |P2Thread1of1ForFork0_#t~ite27_Out1589963394| ~a$w_buff0_used~0_In1589963394)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1589963394|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1589963394, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1589963394, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1589963394, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1589963394, ~weak$$choice2~0=~weak$$choice2~0_In1589963394} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1589963394|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1589963394|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1589963394, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1589963394, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1589963394, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1589963394, ~weak$$choice2~0=~weak$$choice2~0_In1589963394} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:59:16,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In700895104 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out700895104| ~a$w_buff1_used~0_In700895104) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In700895104 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In700895104 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In700895104 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In700895104 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite29_Out700895104| |P2Thread1of1ForFork0_#t~ite30_Out700895104|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In700895104| |P2Thread1of1ForFork0_#t~ite29_Out700895104|) (not .cse0) (= ~a$w_buff1_used~0_In700895104 |P2Thread1of1ForFork0_#t~ite30_Out700895104|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In700895104, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700895104, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In700895104, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700895104, ~weak$$choice2~0=~weak$$choice2~0_In700895104, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In700895104|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In700895104, ~a$w_buff0_used~0=~a$w_buff0_used~0_In700895104, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In700895104, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out700895104|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In700895104, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out700895104|, ~weak$$choice2~0=~weak$$choice2~0_In700895104} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:59:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:59:16,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:59:16,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1949103328 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1949103328 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1949103328| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1949103328| ~a$w_buff0_used~0_In-1949103328) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1949103328, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1949103328} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1949103328, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1949103328, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1949103328|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:59:16,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1050655637 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1050655637 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1050655637 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1050655637 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1050655637| ~a$w_buff1_used~0_In-1050655637) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1050655637| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1050655637, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1050655637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1050655637} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1050655637, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1050655637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1050655637|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1050655637} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:59:16,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In602505607 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In602505607 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out602505607|)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out602505607| ~a$r_buff0_thd2~0_In602505607) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In602505607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602505607} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In602505607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602505607, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out602505607|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:59:16,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In899938650 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In899938650 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In899938650 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In899938650 256)))) (or (and (= ~a$r_buff1_thd2~0_In899938650 |P1Thread1of1ForFork2_#t~ite14_Out899938650|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out899938650|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In899938650, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In899938650, ~a$w_buff0_used~0=~a$w_buff0_used~0_In899938650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In899938650} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In899938650, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In899938650, ~a$w_buff0_used~0=~a$w_buff0_used~0_In899938650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In899938650, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out899938650|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:59:16,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:59:16,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:59:16,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out985517917| |P2Thread1of1ForFork0_#t~ite38_Out985517917|)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In985517917 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In985517917 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out985517917| ~a~0_In985517917) .cse0 (or .cse1 .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out985517917| ~a$w_buff1~0_In985517917) .cse0 (not .cse2) (not .cse1)))) InVars {~a~0=~a~0_In985517917, ~a$w_buff1~0=~a$w_buff1~0_In985517917, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In985517917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In985517917} OutVars{~a~0=~a~0_In985517917, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out985517917|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out985517917|, ~a$w_buff1~0=~a$w_buff1~0_In985517917, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In985517917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In985517917} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:59:16,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-901255175 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-901255175 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-901255175|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-901255175 |P2Thread1of1ForFork0_#t~ite40_Out-901255175|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-901255175} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-901255175|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-901255175} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:59:16,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In-167754557 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-167754557 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-167754557 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-167754557 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-167754557| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-167754557| ~a$w_buff1_used~0_In-167754557) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-167754557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-167754557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-167754557} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-167754557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-167754557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-167754557, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-167754557|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:59:16,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1456301977 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1456301977 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1456301977| ~a$r_buff0_thd3~0_In-1456301977) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1456301977|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1456301977} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1456301977, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1456301977|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:59:16,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-2123046613 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2123046613 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-2123046613 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2123046613 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-2123046613|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In-2123046613 |P2Thread1of1ForFork0_#t~ite43_Out-2123046613|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2123046613, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123046613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2123046613, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2123046613} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2123046613|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2123046613, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2123046613, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2123046613, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2123046613} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:59:16,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:59:16,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: 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_6|, ~__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-26 21:59:16,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out493896588| |ULTIMATE.start_main_#t~ite47_Out493896588|)) (.cse1 (= (mod ~a$w_buff1_used~0_In493896588 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In493896588 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out493896588| ~a~0_In493896588) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out493896588| ~a$w_buff1~0_In493896588)))) InVars {~a~0=~a~0_In493896588, ~a$w_buff1~0=~a$w_buff1~0_In493896588, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In493896588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In493896588} OutVars{~a~0=~a~0_In493896588, ~a$w_buff1~0=~a$w_buff1~0_In493896588, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out493896588|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In493896588, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out493896588|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In493896588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:59:16,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-611402943 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-611402943 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-611402943 |ULTIMATE.start_main_#t~ite49_Out-611402943|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-611402943|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-611402943, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-611402943} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-611402943, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-611402943|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-611402943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:59:16,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-670000282 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-670000282 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-670000282 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-670000282 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-670000282 |ULTIMATE.start_main_#t~ite50_Out-670000282|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-670000282| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-670000282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-670000282, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-670000282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-670000282} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-670000282|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-670000282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-670000282, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-670000282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-670000282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:59:16,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1787626736 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1787626736 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1787626736| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1787626736 |ULTIMATE.start_main_#t~ite51_Out1787626736|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1787626736, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1787626736} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1787626736|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787626736, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1787626736} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:59:16,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-164426591 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-164426591 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-164426591 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-164426591 256)))) (or (and (= ~a$r_buff1_thd0~0_In-164426591 |ULTIMATE.start_main_#t~ite52_Out-164426591|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-164426591|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-164426591, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-164426591, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-164426591, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-164426591} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-164426591|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-164426591, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-164426591, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-164426591, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-164426591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:59:16,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:59:16,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:59:16 BasicIcfg [2019-12-26 21:59:16,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:59:16,302 INFO L168 Benchmark]: Toolchain (without parser) took 141994.93 ms. Allocated memory was 137.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,303 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.73 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 154.1 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.43 ms. Allocated memory is still 201.3 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,304 INFO L168 Benchmark]: Boogie Preprocessor took 43.35 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,304 INFO L168 Benchmark]: RCFGBuilder took 891.04 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.9 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,305 INFO L168 Benchmark]: TraceAbstraction took 140148.11 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:59:16,307 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.61 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.73 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 154.1 MB in the end (delta: -54.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.43 ms. Allocated memory is still 201.3 MB. Free memory was 154.1 MB in the beginning and 151.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.35 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.04 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.9 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140148.11 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=7, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 139.8s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 70.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9584 SDtfs, 14307 SDslu, 42464 SDs, 0 SdLazy, 43391 SolverSat, 911 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 874 GetRequests, 111 SyntacticMatches, 32 SemanticMatches, 731 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5514 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 34.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 201036 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2435 NumberOfCodeBlocks, 2435 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2325 ConstructedInterpolants, 0 QuantifiedInterpolants, 782428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...