/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/mix002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:09:45,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:09:45,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:09:45,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:09:45,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:09:45,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:09:45,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:09:45,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:09:45,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:09:45,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:09:45,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:09:45,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:09:45,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:09:45,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:09:45,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:09:45,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:09:45,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:09:45,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:09:45,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:09:45,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:09:45,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:09:45,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:09:45,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:09:45,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:09:45,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:09:45,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:09:45,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:09:45,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:09:45,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:09:45,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:09:45,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:09:45,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:09:45,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:09:45,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:09:45,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:09:45,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:09:45,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:09:45,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:09:45,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:09:45,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:09:45,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:09:45,119 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:09:45,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:09:45,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:09:45,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:09:45,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:09:45,150 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:09:45,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:09:45,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:09:45,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:09:45,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:09:45,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:09:45,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:09:45,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:09:45,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:09:45,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:09:45,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:09:45,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:09:45,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:09:45,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:09:45,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:09:45,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:09:45,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:09:45,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:09:45,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:09:45,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:09:45,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:09:45,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:09:45,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:09:45,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:09:45,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:09:45,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:09:45,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:09:45,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:09:45,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:09:45,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:09:45,487 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:09:45,489 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i [2019-12-26 21:09:45,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9388d08/a821c3bef67a436697506ce4108a651f/FLAG0d832a634 [2019-12-26 21:09:46,119 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:09:46,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_rmo.oepc.i [2019-12-26 21:09:46,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9388d08/a821c3bef67a436697506ce4108a651f/FLAG0d832a634 [2019-12-26 21:09:46,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9388d08/a821c3bef67a436697506ce4108a651f [2019-12-26 21:09:46,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:09:46,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:09:46,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:09:46,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:09:46,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:09:46,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:09:46" (1/1) ... [2019-12-26 21:09:46,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2717e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:46, skipping insertion in model container [2019-12-26 21:09:46,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:09:46" (1/1) ... [2019-12-26 21:09:46,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:09:46,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:09:47,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:09:47,022 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:09:47,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:09:47,167 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:09:47,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47 WrapperNode [2019-12-26 21:09:47,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:09:47,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:09:47,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:09:47,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:09:47,178 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:09:47" (1/1) ... [2019-12-26 21:09:47,200 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:09:47" (1/1) ... [2019-12-26 21:09:47,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:09:47,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:09:47,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:09:47,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:09:47,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (1/1) ... [2019-12-26 21:09:47,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:09:47,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:09:47,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:09:47,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:09:47,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (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:09:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:09:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:09:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:09:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:09:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:09:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:09:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:09:47,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:09:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:09:47,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:09:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:09:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:09:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:09:47,380 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:09:48,149 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:09:48,149 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:09:48,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:09:48 BoogieIcfgContainer [2019-12-26 21:09:48,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:09:48,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:09:48,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:09:48,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:09:48,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:09:46" (1/3) ... [2019-12-26 21:09:48,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd4aff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:09:48, skipping insertion in model container [2019-12-26 21:09:48,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:09:47" (2/3) ... [2019-12-26 21:09:48,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd4aff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:09:48, skipping insertion in model container [2019-12-26 21:09:48,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:09:48" (3/3) ... [2019-12-26 21:09:48,161 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_rmo.oepc.i [2019-12-26 21:09:48,172 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:09:48,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:09:48,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:09:48,185 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:09:48,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,340 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,342 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:09:48,384 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:09:48,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:09:48,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:09:48,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:09:48,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:09:48,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:09:48,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:09:48,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:09:48,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:09:48,421 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-26 21:09:48,423 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 21:09:48,551 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 21:09:48,552 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:09:48,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:09:48,592 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 21:09:48,692 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 21:09:48,692 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:09:48,702 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:09:48,728 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:09:48,729 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:09:53,993 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:09:54,164 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:09:54,346 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-26 21:09:54,347 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-26 21:09:54,350 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-26 21:10:12,781 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-26 21:10:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-26 21:10:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:10:12,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:12,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:10:12,789 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:10:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-26 21:10:12,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:12,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593340826] [2019-12-26 21:10:12,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:13,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593340826] [2019-12-26 21:10:13,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:13,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:10:13,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197583296] [2019-12-26 21:10:13,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:13,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:13,045 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-26 21:10:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:14,083 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-26 21:10:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:14,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:10:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:17,913 INFO L225 Difference]: With dead ends: 119349 [2019-12-26 21:10:17,914 INFO L226 Difference]: Without dead ends: 112420 [2019-12-26 21:10:17,918 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:10:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-26 21:10:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-26 21:10:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-26 21:10:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-26 21:10:29,879 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-26 21:10:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:29,879 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-26 21:10:29,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-26 21:10:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:10:29,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:29,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:29,885 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:10:29,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:29,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-26 21:10:29,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:29,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666789655] [2019-12-26 21:10:29,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:30,022 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:10:30,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666789655] [2019-12-26 21:10:30,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:30,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:10:30,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968153499] [2019-12-26 21:10:30,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:10:30,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:30,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:10:30,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:10:30,026 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-26 21:10:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:31,244 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-26 21:10:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:10:31,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:10:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:37,072 INFO L225 Difference]: With dead ends: 179210 [2019-12-26 21:10:37,072 INFO L226 Difference]: Without dead ends: 179161 [2019-12-26 21:10:37,073 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:10:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-26 21:10:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-26 21:10:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-26 21:10:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-26 21:10:47,524 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-26 21:10:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:47,524 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-26 21:10:47,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:10:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-26 21:10:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:10:47,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:47,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:10:47,532 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:10:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-26 21:10:47,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:47,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206460975] [2019-12-26 21:10:47,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:47,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:10:47,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206460975] [2019-12-26 21:10:47,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:47,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:10:47,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105043248] [2019-12-26 21:10:47,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:47,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:47,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:47,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:47,602 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-26 21:10:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:47,743 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-26 21:10:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:47,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:10:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:47,809 INFO L225 Difference]: With dead ends: 34811 [2019-12-26 21:10:47,809 INFO L226 Difference]: Without dead ends: 34811 [2019-12-26 21:10:47,809 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:10:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-26 21:10:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-26 21:10:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-26 21:10:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-26 21:10:53,357 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-26 21:10:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:53,357 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-26 21:10:53,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-26 21:10:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:10:53,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:53,360 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:10:53,360 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:10:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:53,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-26 21:10:53,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:53,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504397564] [2019-12-26 21:10:53,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:53,484 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:10:53,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504397564] [2019-12-26 21:10:53,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:53,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:53,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577161892] [2019-12-26 21:10:53,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:10:53,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:53,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:10:53,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:10:53,491 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-26 21:10:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:54,068 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-26 21:10:54,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:10:54,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:10:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:54,149 INFO L225 Difference]: With dead ends: 48236 [2019-12-26 21:10:54,149 INFO L226 Difference]: Without dead ends: 48236 [2019-12-26 21:10:54,149 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:10:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-26 21:10:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-26 21:10:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-26 21:10:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-26 21:10:55,415 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-26 21:10:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:55,416 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-26 21:10:55,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:10:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-26 21:10:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:10:55,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:55,427 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:10:55,428 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:10:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-26 21:10:55,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:55,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207314316] [2019-12-26 21:10:55,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:55,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207314316] [2019-12-26 21:10:55,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:55,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:10:55,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11202624] [2019-12-26 21:10:55,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:10:55,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:10:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:10:55,597 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-26 21:10:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:56,551 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-26 21:10:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:10:56,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:10:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:56,665 INFO L225 Difference]: With dead ends: 62182 [2019-12-26 21:10:56,665 INFO L226 Difference]: Without dead ends: 62175 [2019-12-26 21:10:56,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:10:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-26 21:10:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-26 21:10:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-26 21:10:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-26 21:10:57,508 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-26 21:10:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:57,509 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-26 21:10:57,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:10:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-26 21:10:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:10:57,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:57,523 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:10:57,524 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:10:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-26 21:10:57,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:57,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855544039] [2019-12-26 21:10:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:10:57,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855544039] [2019-12-26 21:10:57,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:57,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:57,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130070517] [2019-12-26 21:10:57,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:10:57,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:10:57,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:10:57,577 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-26 21:10:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:57,643 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-26 21:10:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:10:57,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:10:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:57,671 INFO L225 Difference]: With dead ends: 16196 [2019-12-26 21:10:57,672 INFO L226 Difference]: Without dead ends: 16196 [2019-12-26 21:10:57,672 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:10:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-26 21:10:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-26 21:10:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-26 21:10:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-26 21:10:58,280 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-26 21:10:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:58,280 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-26 21:10:58,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:10:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-26 21:10:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:10:58,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:58,293 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:10:58,294 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:10:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-26 21:10:58,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:58,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705620091] [2019-12-26 21:10:58,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:58,379 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:10:58,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705620091] [2019-12-26 21:10:58,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:58,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:10:58,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197348585] [2019-12-26 21:10:58,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:58,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:58,381 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-26 21:10:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:58,484 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-26 21:10:58,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:58,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:10:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:58,513 INFO L225 Difference]: With dead ends: 23073 [2019-12-26 21:10:58,514 INFO L226 Difference]: Without dead ends: 23073 [2019-12-26 21:10:58,514 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:10:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-26 21:10:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-26 21:10:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-26 21:10:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-26 21:10:58,809 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-26 21:10:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:58,810 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-26 21:10:58,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:10:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-26 21:10:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:10:58,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:58,824 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:10:58,825 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:10:58,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-26 21:10:58,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:58,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250790446] [2019-12-26 21:10:58,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:58,906 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:10:58,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250790446] [2019-12-26 21:10:58,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:58,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:10:58,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248060511] [2019-12-26 21:10:58,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:10:58,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:10:58,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:10:58,908 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-26 21:10:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:59,429 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-26 21:10:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:10:59,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:10:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:59,463 INFO L225 Difference]: With dead ends: 24767 [2019-12-26 21:10:59,463 INFO L226 Difference]: Without dead ends: 24767 [2019-12-26 21:10:59,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:10:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-26 21:10:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-26 21:10:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-26 21:10:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-26 21:10:59,781 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-26 21:10:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:10:59,781 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-26 21:10:59,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:10:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-26 21:10:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:10:59,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:59,803 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:10:59,803 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:10:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-26 21:10:59,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:59,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226331167] [2019-12-26 21:10:59,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:59,898 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:10:59,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226331167] [2019-12-26 21:10:59,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:10:59,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090270432] [2019-12-26 21:10:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:10:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:10:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:10:59,900 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-26 21:11:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:01,095 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-26 21:11:01,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:11:01,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:11:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:01,138 INFO L225 Difference]: With dead ends: 27601 [2019-12-26 21:11:01,138 INFO L226 Difference]: Without dead ends: 27601 [2019-12-26 21:11:01,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:11:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-26 21:11:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-26 21:11:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-26 21:11:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-26 21:11:01,727 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-26 21:11:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:01,727 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-26 21:11:01,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-26 21:11:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:11:01,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:01,752 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:11:01,752 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:11:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-26 21:11:01,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:01,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435207510] [2019-12-26 21:11:01,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:01,807 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:11:01,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435207510] [2019-12-26 21:11:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:01,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:11:01,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611285683] [2019-12-26 21:11:01,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:01,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:01,809 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-26 21:11:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:01,885 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-26 21:11:01,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:01,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:11:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:01,924 INFO L225 Difference]: With dead ends: 18411 [2019-12-26 21:11:01,925 INFO L226 Difference]: Without dead ends: 18411 [2019-12-26 21:11:01,925 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:11:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-26 21:11:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-26 21:11:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-26 21:11:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-26 21:11:02,339 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-26 21:11:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:02,341 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-26 21:11:02,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-26 21:11:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:11:02,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:02,375 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:11:02,376 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:11:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-26 21:11:02,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:02,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753432736] [2019-12-26 21:11:02,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:02,472 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:11:02,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753432736] [2019-12-26 21:11:02,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:02,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:02,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549404174] [2019-12-26 21:11:02,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:02,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:02,474 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-26 21:11:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:02,561 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-26 21:11:02,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:02,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 21:11:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:02,596 INFO L225 Difference]: With dead ends: 18325 [2019-12-26 21:11:02,596 INFO L226 Difference]: Without dead ends: 18325 [2019-12-26 21:11:02,597 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:11:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-26 21:11:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-26 21:11:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-26 21:11:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-26 21:11:03,025 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-26 21:11:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:03,026 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-26 21:11:03,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-26 21:11:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:11:03,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:03,052 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] [2019-12-26 21:11:03,053 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:11:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-26 21:11:03,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:03,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042671216] [2019-12-26 21:11:03,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:03,124 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:11:03,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042671216] [2019-12-26 21:11:03,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:03,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:03,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596948812] [2019-12-26 21:11:03,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:03,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:03,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:03,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:03,126 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-26 21:11:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:03,200 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-26 21:11:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:03,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 21:11:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:03,222 INFO L225 Difference]: With dead ends: 15143 [2019-12-26 21:11:03,222 INFO L226 Difference]: Without dead ends: 15143 [2019-12-26 21:11:03,223 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:11:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-26 21:11:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-26 21:11:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-26 21:11:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-26 21:11:03,445 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-26 21:11:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:03,446 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-26 21:11:03,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-26 21:11:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:03,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:03,463 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:11:03,463 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:11:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-26 21:11:03,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:03,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009322186] [2019-12-26 21:11:03,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:03,516 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:11:03,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009322186] [2019-12-26 21:11:03,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:03,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:03,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224027604] [2019-12-26 21:11:03,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:03,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:03,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:03,518 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-26 21:11:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:03,624 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-26 21:11:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:03,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:11:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:03,660 INFO L225 Difference]: With dead ends: 19655 [2019-12-26 21:11:03,661 INFO L226 Difference]: Without dead ends: 19655 [2019-12-26 21:11:03,667 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:11:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-26 21:11:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-26 21:11:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-26 21:11:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-26 21:11:04,079 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-26 21:11:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:04,079 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-26 21:11:04,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-26 21:11:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:04,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:04,105 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:11:04,105 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:11:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:04,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-26 21:11:04,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:04,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605211746] [2019-12-26 21:11:04,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:04,492 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:11:04,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605211746] [2019-12-26 21:11:04,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:04,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:11:04,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837886052] [2019-12-26 21:11:04,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:04,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:04,494 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-26 21:11:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:04,985 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-26 21:11:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:04,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:11:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:05,037 INFO L225 Difference]: With dead ends: 43069 [2019-12-26 21:11:05,037 INFO L226 Difference]: Without dead ends: 33469 [2019-12-26 21:11:05,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:11:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-26 21:11:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-26 21:11:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-26 21:11:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-26 21:11:05,421 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-26 21:11:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:05,421 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-26 21:11:05,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-26 21:11:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:05,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:05,446 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:11:05,447 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:11:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-26 21:11:05,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:05,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402073350] [2019-12-26 21:11:05,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:05,529 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:11:05,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402073350] [2019-12-26 21:11:05,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:05,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:11:05,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991272463] [2019-12-26 21:11:05,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:05,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:05,531 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-26 21:11:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:05,980 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-26 21:11:05,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:05,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:11:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:06,044 INFO L225 Difference]: With dead ends: 48601 [2019-12-26 21:11:06,044 INFO L226 Difference]: Without dead ends: 35759 [2019-12-26 21:11:06,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:11:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-26 21:11:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-26 21:11:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-26 21:11:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-26 21:11:06,492 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-26 21:11:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:06,492 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-26 21:11:06,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-26 21:11:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:06,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:06,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:06,517 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:11:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-26 21:11:06,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:06,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249710489] [2019-12-26 21:11:06,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:06,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:11:06,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249710489] [2019-12-26 21:11:06,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:06,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:06,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832333925] [2019-12-26 21:11:06,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:06,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:06,645 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-26 21:11:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:08,296 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-26 21:11:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:08,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:11:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:08,393 INFO L225 Difference]: With dead ends: 65932 [2019-12-26 21:11:08,393 INFO L226 Difference]: Without dead ends: 63310 [2019-12-26 21:11:08,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:11:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-26 21:11:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-26 21:11:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-26 21:11:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-26 21:11:09,037 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-26 21:11:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:09,037 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-26 21:11:09,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-26 21:11:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:09,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:09,059 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:11:09,059 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:11:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-26 21:11:09,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:09,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121342244] [2019-12-26 21:11:09,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:09,172 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:11:09,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121342244] [2019-12-26 21:11:09,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:09,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:09,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029163510] [2019-12-26 21:11:09,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:09,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:09,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:09,174 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-26 21:11:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:10,430 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-26 21:11:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:10,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:11:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:10,534 INFO L225 Difference]: With dead ends: 78329 [2019-12-26 21:11:10,534 INFO L226 Difference]: Without dead ends: 75771 [2019-12-26 21:11:10,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 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:11:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-26 21:11:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-26 21:11:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-26 21:11:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-26 21:11:11,631 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-26 21:11:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:11,631 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-26 21:11:11,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-26 21:11:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:11,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:11,654 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:11:11,655 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:11:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-26 21:11:11,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:11,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043296253] [2019-12-26 21:11:11,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:11,724 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:11:11,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043296253] [2019-12-26 21:11:11,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:11,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:11,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755287356] [2019-12-26 21:11:11,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:11,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:11,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:11,726 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-26 21:11:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:11,860 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-26 21:11:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:11,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:11:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:11,895 INFO L225 Difference]: With dead ends: 25241 [2019-12-26 21:11:11,896 INFO L226 Difference]: Without dead ends: 25241 [2019-12-26 21:11:11,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-26 21:11:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-26 21:11:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-26 21:11:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-26 21:11:12,246 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-26 21:11:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:12,247 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-26 21:11:12,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-26 21:11:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:12,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:12,277 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:11:12,278 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:11:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-26 21:11:12,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:12,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489840420] [2019-12-26 21:11:12,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:12,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489840420] [2019-12-26 21:11:12,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:12,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:11:12,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033687108] [2019-12-26 21:11:12,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:11:12,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:11:12,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:11:12,363 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-26 21:11:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:13,225 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-26 21:11:13,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:11:13,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 21:11:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:13,290 INFO L225 Difference]: With dead ends: 52001 [2019-12-26 21:11:13,290 INFO L226 Difference]: Without dead ends: 48845 [2019-12-26 21:11:13,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:11:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-26 21:11:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-26 21:11:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-26 21:11:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-26 21:11:13,785 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-26 21:11:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:13,785 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-26 21:11:13,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:11:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-26 21:11:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:13,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:13,810 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:11:13,810 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:11:13,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-26 21:11:13,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:13,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667533271] [2019-12-26 21:11:13,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:13,923 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:11:13,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667533271] [2019-12-26 21:11:13,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:13,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:13,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926826832] [2019-12-26 21:11:13,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:13,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:13,925 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-26 21:11:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:15,639 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-26 21:11:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:11:15,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:11:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:15,712 INFO L225 Difference]: With dead ends: 59225 [2019-12-26 21:11:15,713 INFO L226 Difference]: Without dead ends: 56069 [2019-12-26 21:11:15,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:11:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-26 21:11:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-26 21:11:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-26 21:11:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-26 21:11:16,244 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-26 21:11:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:16,245 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-26 21:11:16,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-26 21:11:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:16,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:16,266 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:11:16,266 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:11:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-26 21:11:16,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:16,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41633949] [2019-12-26 21:11:16,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:16,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41633949] [2019-12-26 21:11:16,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:16,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:16,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707608386] [2019-12-26 21:11:16,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:16,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:16,388 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-26 21:11:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:17,724 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-26 21:11:17,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:17,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:11:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:17,809 INFO L225 Difference]: With dead ends: 65701 [2019-12-26 21:11:17,809 INFO L226 Difference]: Without dead ends: 62568 [2019-12-26 21:11:17,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:11:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-26 21:11:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-26 21:11:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-26 21:11:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-26 21:11:18,440 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-26 21:11:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:18,441 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-26 21:11:18,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-26 21:11:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:18,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:18,468 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:11:18,468 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:11:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:18,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-26 21:11:18,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:18,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294917187] [2019-12-26 21:11:18,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:18,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:11:18,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294917187] [2019-12-26 21:11:18,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:18,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:11:18,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109561356] [2019-12-26 21:11:18,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:18,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:18,603 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-26 21:11:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:19,704 INFO L93 Difference]: Finished difference Result 33222 states and 101569 transitions. [2019-12-26 21:11:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:11:19,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 21:11:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:19,748 INFO L225 Difference]: With dead ends: 33222 [2019-12-26 21:11:19,748 INFO L226 Difference]: Without dead ends: 33222 [2019-12-26 21:11:19,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33222 states. [2019-12-26 21:11:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33222 to 20376. [2019-12-26 21:11:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20376 states. [2019-12-26 21:11:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 62283 transitions. [2019-12-26 21:11:20,129 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 62283 transitions. Word has length 66 [2019-12-26 21:11:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:20,130 INFO L462 AbstractCegarLoop]: Abstraction has 20376 states and 62283 transitions. [2019-12-26 21:11:20,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 62283 transitions. [2019-12-26 21:11:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:20,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:20,153 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:11:20,153 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:11:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-26 21:11:20,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:20,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768165227] [2019-12-26 21:11:20,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:20,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:11:20,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768165227] [2019-12-26 21:11:20,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:20,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:20,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483855648] [2019-12-26 21:11:20,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:20,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:20,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:20,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:20,226 INFO L87 Difference]: Start difference. First operand 20376 states and 62283 transitions. Second operand 4 states. [2019-12-26 21:11:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:20,387 INFO L93 Difference]: Finished difference Result 20191 states and 61547 transitions. [2019-12-26 21:11:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:11:20,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:11:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:20,423 INFO L225 Difference]: With dead ends: 20191 [2019-12-26 21:11:20,423 INFO L226 Difference]: Without dead ends: 20191 [2019-12-26 21:11:20,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-12-26 21:11:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18496. [2019-12-26 21:11:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-12-26 21:11:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 56455 transitions. [2019-12-26 21:11:20,722 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 56455 transitions. Word has length 66 [2019-12-26 21:11:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:20,722 INFO L462 AbstractCegarLoop]: Abstraction has 18496 states and 56455 transitions. [2019-12-26 21:11:20,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 56455 transitions. [2019-12-26 21:11:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:20,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:20,743 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:11:20,743 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:11:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-26 21:11:20,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:20,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485023321] [2019-12-26 21:11:20,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:20,803 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:11:20,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485023321] [2019-12-26 21:11:20,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:20,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:20,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834451910] [2019-12-26 21:11:20,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:20,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:20,805 INFO L87 Difference]: Start difference. First operand 18496 states and 56455 transitions. Second operand 3 states. [2019-12-26 21:11:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:20,877 INFO L93 Difference]: Finished difference Result 16117 states and 48226 transitions. [2019-12-26 21:11:20,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:20,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:11:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:20,899 INFO L225 Difference]: With dead ends: 16117 [2019-12-26 21:11:20,899 INFO L226 Difference]: Without dead ends: 16117 [2019-12-26 21:11:20,899 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:11:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-26 21:11:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14647. [2019-12-26 21:11:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-26 21:11:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 43816 transitions. [2019-12-26 21:11:21,123 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 43816 transitions. Word has length 66 [2019-12-26 21:11:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:21,123 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 43816 transitions. [2019-12-26 21:11:21,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 43816 transitions. [2019-12-26 21:11:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:21,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:21,138 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:11:21,139 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:11:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-26 21:11:21,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:21,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531265176] [2019-12-26 21:11:21,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:21,241 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:11:21,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531265176] [2019-12-26 21:11:21,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:21,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:21,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124994738] [2019-12-26 21:11:21,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:21,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:21,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:21,243 INFO L87 Difference]: Start difference. First operand 14647 states and 43816 transitions. Second operand 9 states. [2019-12-26 21:11:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:22,692 INFO L93 Difference]: Finished difference Result 28454 states and 84160 transitions. [2019-12-26 21:11:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:11:22,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 21:11:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:22,723 INFO L225 Difference]: With dead ends: 28454 [2019-12-26 21:11:22,723 INFO L226 Difference]: Without dead ends: 23657 [2019-12-26 21:11:22,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:11:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states. [2019-12-26 21:11:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 15071. [2019-12-26 21:11:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-26 21:11:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 44798 transitions. [2019-12-26 21:11:23,004 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 44798 transitions. Word has length 67 [2019-12-26 21:11:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:23,004 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 44798 transitions. [2019-12-26 21:11:23,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 44798 transitions. [2019-12-26 21:11:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:23,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:23,020 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:11:23,020 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:11:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-26 21:11:23,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:23,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559877246] [2019-12-26 21:11:23,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:23,185 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:11:23,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559877246] [2019-12-26 21:11:23,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:23,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:11:23,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694751203] [2019-12-26 21:11:23,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:11:23,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:23,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:11:23,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:11:23,187 INFO L87 Difference]: Start difference. First operand 15071 states and 44798 transitions. Second operand 11 states. [2019-12-26 21:11:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:24,562 INFO L93 Difference]: Finished difference Result 19576 states and 57688 transitions. [2019-12-26 21:11:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:11:24,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:11:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:24,588 INFO L225 Difference]: With dead ends: 19576 [2019-12-26 21:11:24,588 INFO L226 Difference]: Without dead ends: 18021 [2019-12-26 21:11:24,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:11:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18021 states. [2019-12-26 21:11:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18021 to 15164. [2019-12-26 21:11:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15164 states. [2019-12-26 21:11:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15164 states to 15164 states and 45029 transitions. [2019-12-26 21:11:24,821 INFO L78 Accepts]: Start accepts. Automaton has 15164 states and 45029 transitions. Word has length 67 [2019-12-26 21:11:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:24,821 INFO L462 AbstractCegarLoop]: Abstraction has 15164 states and 45029 transitions. [2019-12-26 21:11:24,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:11:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15164 states and 45029 transitions. [2019-12-26 21:11:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:24,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:24,836 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:11:24,836 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:11:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 3 times [2019-12-26 21:11:24,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:24,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741688867] [2019-12-26 21:11:24,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:25,428 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:11:25,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741688867] [2019-12-26 21:11:25,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:25,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 21:11:25,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694731826] [2019-12-26 21:11:25,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 21:11:25,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 21:11:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:11:25,430 INFO L87 Difference]: Start difference. First operand 15164 states and 45029 transitions. Second operand 20 states. [2019-12-26 21:11:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:29,591 INFO L93 Difference]: Finished difference Result 17273 states and 50604 transitions. [2019-12-26 21:11:29,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 21:11:29,592 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-26 21:11:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:29,614 INFO L225 Difference]: With dead ends: 17273 [2019-12-26 21:11:29,615 INFO L226 Difference]: Without dead ends: 16305 [2019-12-26 21:11:29,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=259, Invalid=1811, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 21:11:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16305 states. [2019-12-26 21:11:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16305 to 15461. [2019-12-26 21:11:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15461 states. [2019-12-26 21:11:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15461 states to 15461 states and 45781 transitions. [2019-12-26 21:11:29,849 INFO L78 Accepts]: Start accepts. Automaton has 15461 states and 45781 transitions. Word has length 67 [2019-12-26 21:11:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:29,850 INFO L462 AbstractCegarLoop]: Abstraction has 15461 states and 45781 transitions. [2019-12-26 21:11:29,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 21:11:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 15461 states and 45781 transitions. [2019-12-26 21:11:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:29,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:29,866 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:11:29,867 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:11:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash -351875605, now seen corresponding path program 4 times [2019-12-26 21:11:29,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:29,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618978977] [2019-12-26 21:11:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:30,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:30,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618978977] [2019-12-26 21:11:30,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:30,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 21:11:30,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397304134] [2019-12-26 21:11:30,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 21:11:30,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 21:11:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:11:30,538 INFO L87 Difference]: Start difference. First operand 15461 states and 45781 transitions. Second operand 20 states. [2019-12-26 21:11:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:35,301 INFO L93 Difference]: Finished difference Result 18225 states and 53173 transitions. [2019-12-26 21:11:35,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 21:11:35,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-26 21:11:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:35,324 INFO L225 Difference]: With dead ends: 18225 [2019-12-26 21:11:35,324 INFO L226 Difference]: Without dead ends: 17444 [2019-12-26 21:11:35,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=1900, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 21:11:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17444 states. [2019-12-26 21:11:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17444 to 15593. [2019-12-26 21:11:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15593 states. [2019-12-26 21:11:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15593 states to 15593 states and 46201 transitions. [2019-12-26 21:11:35,564 INFO L78 Accepts]: Start accepts. Automaton has 15593 states and 46201 transitions. Word has length 67 [2019-12-26 21:11:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:35,564 INFO L462 AbstractCegarLoop]: Abstraction has 15593 states and 46201 transitions. [2019-12-26 21:11:35,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 21:11:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 15593 states and 46201 transitions. [2019-12-26 21:11:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:35,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:35,580 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:11:35,580 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:11:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1337728997, now seen corresponding path program 5 times [2019-12-26 21:11:35,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:35,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047255479] [2019-12-26 21:11:35,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:35,759 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:11:35,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047255479] [2019-12-26 21:11:35,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:35,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:11:35,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296540072] [2019-12-26 21:11:35,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:11:35,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:11:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:11:35,762 INFO L87 Difference]: Start difference. First operand 15593 states and 46201 transitions. Second operand 12 states. [2019-12-26 21:11:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:37,252 INFO L93 Difference]: Finished difference Result 20385 states and 59737 transitions. [2019-12-26 21:11:37,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:11:37,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:11:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:37,276 INFO L225 Difference]: With dead ends: 20385 [2019-12-26 21:11:37,277 INFO L226 Difference]: Without dead ends: 19726 [2019-12-26 21:11:37,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:11:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19726 states. [2019-12-26 21:11:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19726 to 15523. [2019-12-26 21:11:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15523 states. [2019-12-26 21:11:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15523 states to 15523 states and 46029 transitions. [2019-12-26 21:11:37,527 INFO L78 Accepts]: Start accepts. Automaton has 15523 states and 46029 transitions. Word has length 67 [2019-12-26 21:11:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:37,527 INFO L462 AbstractCegarLoop]: Abstraction has 15523 states and 46029 transitions. [2019-12-26 21:11:37,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:11:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15523 states and 46029 transitions. [2019-12-26 21:11:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:37,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:37,544 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:11:37,544 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:11:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:37,544 INFO L82 PathProgramCache]: Analyzing trace with hash -96373001, now seen corresponding path program 6 times [2019-12-26 21:11:37,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:37,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132907235] [2019-12-26 21:11:37,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:38,667 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:11:38,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132907235] [2019-12-26 21:11:38,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:38,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-26 21:11:38,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342979649] [2019-12-26 21:11:38,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-26 21:11:38,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-26 21:11:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:11:38,669 INFO L87 Difference]: Start difference. First operand 15523 states and 46029 transitions. Second operand 25 states. [2019-12-26 21:11:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:44,670 INFO L93 Difference]: Finished difference Result 17513 states and 51451 transitions. [2019-12-26 21:11:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-26 21:11:44,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-26 21:11:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:44,692 INFO L225 Difference]: With dead ends: 17513 [2019-12-26 21:11:44,692 INFO L226 Difference]: Without dead ends: 16379 [2019-12-26 21:11:44,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=279, Invalid=2583, Unknown=0, NotChecked=0, Total=2862 [2019-12-26 21:11:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16379 states. [2019-12-26 21:11:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16379 to 15992. [2019-12-26 21:11:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15992 states. [2019-12-26 21:11:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15992 states to 15992 states and 47325 transitions. [2019-12-26 21:11:44,931 INFO L78 Accepts]: Start accepts. Automaton has 15992 states and 47325 transitions. Word has length 67 [2019-12-26 21:11:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:44,931 INFO L462 AbstractCegarLoop]: Abstraction has 15992 states and 47325 transitions. [2019-12-26 21:11:44,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-26 21:11:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15992 states and 47325 transitions. [2019-12-26 21:11:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:44,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:44,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:44,946 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:11:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash 361095637, now seen corresponding path program 7 times [2019-12-26 21:11:44,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:44,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476888534] [2019-12-26 21:11:44,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:45,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476888534] [2019-12-26 21:11:45,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:45,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 21:11:45,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722181782] [2019-12-26 21:11:45,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 21:11:45,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 21:11:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:11:45,866 INFO L87 Difference]: Start difference. First operand 15992 states and 47325 transitions. Second operand 23 states. [2019-12-26 21:11:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:53,196 INFO L93 Difference]: Finished difference Result 18858 states and 55337 transitions. [2019-12-26 21:11:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-26 21:11:53,197 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-26 21:11:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:53,219 INFO L225 Difference]: With dead ends: 18858 [2019-12-26 21:11:53,219 INFO L226 Difference]: Without dead ends: 17673 [2019-12-26 21:11:53,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=451, Invalid=4379, Unknown=0, NotChecked=0, Total=4830 [2019-12-26 21:11:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17673 states. [2019-12-26 21:11:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17673 to 16452. [2019-12-26 21:11:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16452 states. [2019-12-26 21:11:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16452 states to 16452 states and 48637 transitions. [2019-12-26 21:11:53,445 INFO L78 Accepts]: Start accepts. Automaton has 16452 states and 48637 transitions. Word has length 67 [2019-12-26 21:11:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:53,446 INFO L462 AbstractCegarLoop]: Abstraction has 16452 states and 48637 transitions. [2019-12-26 21:11:53,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 21:11:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 16452 states and 48637 transitions. [2019-12-26 21:11:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:53,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:53,462 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:11:53,462 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:11:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash 48334671, now seen corresponding path program 8 times [2019-12-26 21:11:53,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:53,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089131725] [2019-12-26 21:11:53,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:54,329 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:11:54,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089131725] [2019-12-26 21:11:54,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:54,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 21:11:54,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272817402] [2019-12-26 21:11:54,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 21:11:54,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:54,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 21:11:54,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:11:54,331 INFO L87 Difference]: Start difference. First operand 16452 states and 48637 transitions. Second operand 22 states. [2019-12-26 21:12:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:00,738 INFO L93 Difference]: Finished difference Result 18860 states and 55321 transitions. [2019-12-26 21:12:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-26 21:12:00,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-26 21:12:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:00,764 INFO L225 Difference]: With dead ends: 18860 [2019-12-26 21:12:00,764 INFO L226 Difference]: Without dead ends: 18168 [2019-12-26 21:12:00,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=367, Invalid=2939, Unknown=0, NotChecked=0, Total=3306 [2019-12-26 21:12:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18168 states. [2019-12-26 21:12:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18168 to 16956. [2019-12-26 21:12:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16956 states. [2019-12-26 21:12:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16956 states to 16956 states and 50047 transitions. [2019-12-26 21:12:01,033 INFO L78 Accepts]: Start accepts. Automaton has 16956 states and 50047 transitions. Word has length 67 [2019-12-26 21:12:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:01,034 INFO L462 AbstractCegarLoop]: Abstraction has 16956 states and 50047 transitions. [2019-12-26 21:12:01,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 21:12:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16956 states and 50047 transitions. [2019-12-26 21:12:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:01,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:01,059 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:12:01,059 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:12:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1401614913, now seen corresponding path program 9 times [2019-12-26 21:12:01,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:01,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028180800] [2019-12-26 21:12:01,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:01,774 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:12:01,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028180800] [2019-12-26 21:12:01,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:01,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 21:12:01,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818305308] [2019-12-26 21:12:01,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 21:12:01,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 21:12:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:12:01,776 INFO L87 Difference]: Start difference. First operand 16956 states and 50047 transitions. Second operand 18 states. [2019-12-26 21:12:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:05,569 INFO L93 Difference]: Finished difference Result 21066 states and 61401 transitions. [2019-12-26 21:12:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 21:12:05,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-26 21:12:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:05,596 INFO L225 Difference]: With dead ends: 21066 [2019-12-26 21:12:05,596 INFO L226 Difference]: Without dead ends: 19943 [2019-12-26 21:12:05,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=347, Invalid=2005, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 21:12:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19943 states. [2019-12-26 21:12:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19943 to 17864. [2019-12-26 21:12:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17864 states. [2019-12-26 21:12:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17864 states to 17864 states and 52715 transitions. [2019-12-26 21:12:05,859 INFO L78 Accepts]: Start accepts. Automaton has 17864 states and 52715 transitions. Word has length 67 [2019-12-26 21:12:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:05,860 INFO L462 AbstractCegarLoop]: Abstraction has 17864 states and 52715 transitions. [2019-12-26 21:12:05,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 21:12:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 17864 states and 52715 transitions. [2019-12-26 21:12:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:05,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:05,878 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:12:05,879 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:12:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1902406511, now seen corresponding path program 10 times [2019-12-26 21:12:05,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:05,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709937928] [2019-12-26 21:12:05,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:06,026 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:12:06,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709937928] [2019-12-26 21:12:06,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:06,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:06,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803770604] [2019-12-26 21:12:06,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:06,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:06,028 INFO L87 Difference]: Start difference. First operand 17864 states and 52715 transitions. Second operand 11 states. [2019-12-26 21:12:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:07,176 INFO L93 Difference]: Finished difference Result 35237 states and 103476 transitions. [2019-12-26 21:12:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:12:07,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:07,211 INFO L225 Difference]: With dead ends: 35237 [2019-12-26 21:12:07,211 INFO L226 Difference]: Without dead ends: 26563 [2019-12-26 21:12:07,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:12:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26563 states. [2019-12-26 21:12:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26563 to 15208. [2019-12-26 21:12:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-26 21:12:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44972 transitions. [2019-12-26 21:12:07,737 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44972 transitions. Word has length 67 [2019-12-26 21:12:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:07,738 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44972 transitions. [2019-12-26 21:12:07,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44972 transitions. [2019-12-26 21:12:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:07,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:07,758 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:12:07,758 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:12:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 11 times [2019-12-26 21:12:07,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:07,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140443767] [2019-12-26 21:12:07,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:07,891 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:12:07,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140443767] [2019-12-26 21:12:07,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:07,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:07,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404723916] [2019-12-26 21:12:07,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:07,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:07,893 INFO L87 Difference]: Start difference. First operand 15208 states and 44972 transitions. Second operand 11 states. [2019-12-26 21:12:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:08,688 INFO L93 Difference]: Finished difference Result 26341 states and 77563 transitions. [2019-12-26 21:12:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:12:08,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:08,724 INFO L225 Difference]: With dead ends: 26341 [2019-12-26 21:12:08,724 INFO L226 Difference]: Without dead ends: 26126 [2019-12-26 21:12:08,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:12:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26126 states. [2019-12-26 21:12:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26126 to 14912. [2019-12-26 21:12:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14912 states. [2019-12-26 21:12:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14912 states to 14912 states and 44143 transitions. [2019-12-26 21:12:09,018 INFO L78 Accepts]: Start accepts. Automaton has 14912 states and 44143 transitions. Word has length 67 [2019-12-26 21:12:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 14912 states and 44143 transitions. [2019-12-26 21:12:09,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14912 states and 44143 transitions. [2019-12-26 21:12:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:09,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:09,034 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:12:09,035 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:12:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 12 times [2019-12-26 21:12:09,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:09,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906767777] [2019-12-26 21:12:09,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:12:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:12:09,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:12:09,211 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:12:09,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23| 1) |v_#valid_62|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t50~0.base_23|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23|) |v_ULTIMATE.start_main_~#t50~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23|) 0) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_ULTIMATE.start_main_~#t50~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t50~0.base_23| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_20|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t50~0.offset=|v_ULTIMATE.start_main_~#t50~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ULTIMATE.start_main_~#t50~0.base=|v_ULTIMATE.start_main_~#t50~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.offset, ~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, ULTIMATE.start_main_~#t52~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__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_~#t50~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~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, ULTIMATE.start_main_~#t51~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t51~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t50~0.base, ~main$tmp_guard0~0, #NULL.base, ~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] because there is no mapped edge [2019-12-26 21:12:09,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0~0_Out944852741) (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out944852741|) (= 0 (mod ~a$w_buff1_used~0_Out944852741 256)) (= ~a$w_buff0_used~0_In944852741 ~a$w_buff1_used~0_Out944852741) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out944852741 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out944852741|) (= P0Thread1of1ForFork2_~arg.base_Out944852741 |P0Thread1of1ForFork2_#in~arg.base_In944852741|) (= ~a$w_buff0~0_In944852741 ~a$w_buff1~0_Out944852741) (= |P0Thread1of1ForFork2_#in~arg.offset_In944852741| P0Thread1of1ForFork2_~arg.offset_Out944852741) (= 1 ~a$w_buff0_used~0_Out944852741)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In944852741|, ~a$w_buff0~0=~a$w_buff0~0_In944852741, ~a$w_buff0_used~0=~a$w_buff0_used~0_In944852741, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In944852741|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out944852741, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In944852741|, ~a$w_buff0~0=~a$w_buff0~0_Out944852741, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out944852741, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out944852741, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out944852741, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In944852741|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out944852741, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out944852741, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out944852741|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:12:09,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t51~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t51~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13|) |v_ULTIMATE.start_main_~#t51~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t51~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t51~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_13|, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t51~0.base, ULTIMATE.start_main_~#t51~0.offset] because there is no mapped edge [2019-12-26 21:12:09,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out1355370042| |P1Thread1of1ForFork0_#t~ite9_Out1355370042|)) (.cse2 (= (mod ~a$w_buff1_used~0_In1355370042 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1355370042 256) 0))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1355370042| ~a$w_buff1~0_In1355370042) (not .cse2)) (and .cse0 (= ~a~0_In1355370042 |P1Thread1of1ForFork0_#t~ite9_Out1355370042|) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In1355370042, ~a$w_buff1~0=~a$w_buff1~0_In1355370042, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1355370042, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1355370042} OutVars{~a~0=~a~0_In1355370042, ~a$w_buff1~0=~a$w_buff1~0_In1355370042, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out1355370042|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1355370042, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1355370042|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1355370042} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 21:12:09,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1059031937 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1059031937 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out1059031937| ~a$w_buff0_used~0_In1059031937) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out1059031937|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1059031937, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1059031937} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1059031937, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out1059031937|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1059031937} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 21:12:09,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1941626393 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1941626393 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1941626393 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1941626393 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-1941626393| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite12_Out-1941626393| ~a$w_buff1_used~0_In-1941626393)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1941626393, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1941626393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941626393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941626393} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1941626393, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1941626393, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1941626393|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941626393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941626393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 21:12:09,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1810255705 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1810255705 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite13_Out-1810255705| 0)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out-1810255705| ~a$r_buff0_thd2~0_In-1810255705) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1810255705, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1810255705} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1810255705, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1810255705, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1810255705|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 21:12:09,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-171146455 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-171146455 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-171146455 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-171146455 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite14_Out-171146455| ~a$r_buff1_thd2~0_In-171146455) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-171146455|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-171146455, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-171146455, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-171146455, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-171146455} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-171146455, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-171146455, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-171146455, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-171146455|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-171146455} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 21:12:09,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 21:12:09,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t52~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t52~0.base_12| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t52~0.base_12| 4)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t52~0.offset_10|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12|) |v_ULTIMATE.start_main_~#t52~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_12|, ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.base, ULTIMATE.start_main_~#t52~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 21:12:09,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In784935030 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out784935030| ~a$w_buff0~0_In784935030) (= |P2Thread1of1ForFork1_#t~ite20_In784935030| |P2Thread1of1ForFork1_#t~ite20_Out784935030|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In784935030 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In784935030 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In784935030 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In784935030 256))))) (= ~a$w_buff0~0_In784935030 |P2Thread1of1ForFork1_#t~ite20_Out784935030|) .cse0 (= |P2Thread1of1ForFork1_#t~ite21_Out784935030| |P2Thread1of1ForFork1_#t~ite20_Out784935030|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In784935030|, ~a$w_buff0~0=~a$w_buff0~0_In784935030, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In784935030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In784935030, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In784935030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In784935030, ~weak$$choice2~0=~weak$$choice2~0_In784935030} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out784935030|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out784935030|, ~a$w_buff0~0=~a$w_buff0~0_In784935030, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In784935030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In784935030, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In784935030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In784935030, ~weak$$choice2~0=~weak$$choice2~0_In784935030} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:12:09,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In484396105 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In484396105| |P2Thread1of1ForFork1_#t~ite26_Out484396105|) (= ~a$w_buff0_used~0_In484396105 |P2Thread1of1ForFork1_#t~ite27_Out484396105|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In484396105 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In484396105 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In484396105 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In484396105 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite27_Out484396105| |P2Thread1of1ForFork1_#t~ite26_Out484396105|) (= ~a$w_buff0_used~0_In484396105 |P2Thread1of1ForFork1_#t~ite26_Out484396105|)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In484396105|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In484396105, ~a$w_buff0_used~0=~a$w_buff0_used~0_In484396105, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In484396105, ~a$w_buff1_used~0=~a$w_buff1_used~0_In484396105, ~weak$$choice2~0=~weak$$choice2~0_In484396105} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out484396105|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out484396105|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In484396105, ~a$w_buff0_used~0=~a$w_buff0_used~0_In484396105, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In484396105, ~a$w_buff1_used~0=~a$w_buff1_used~0_In484396105, ~weak$$choice2~0=~weak$$choice2~0_In484396105} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-26 21:12:09,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 21:12:09,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:12:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-735435661 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-735435661 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-735435661| ~a~0_In-735435661) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-735435661 |P2Thread1of1ForFork1_#t~ite38_Out-735435661|)))) InVars {~a~0=~a~0_In-735435661, ~a$w_buff1~0=~a$w_buff1~0_In-735435661, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-735435661, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-735435661} OutVars{~a~0=~a~0_In-735435661, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-735435661|, ~a$w_buff1~0=~a$w_buff1~0_In-735435661, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-735435661, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-735435661} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-26 21:12:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-26 21:12:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1739401280 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1739401280 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite40_Out1739401280| ~a$w_buff0_used~0_In1739401280) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out1739401280| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1739401280, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1739401280} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1739401280, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1739401280, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out1739401280|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 21:12:09,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1663207845 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1663207845 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1663207845 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1663207845 256)))) (or (and (= ~a$w_buff1_used~0_In1663207845 |P2Thread1of1ForFork1_#t~ite41_Out1663207845|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1663207845|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1663207845, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1663207845, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1663207845, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1663207845} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1663207845, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1663207845, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1663207845, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1663207845|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1663207845} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-26 21:12:09,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1292904132 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1292904132 256) 0))) (or (and (= ~a$r_buff0_thd3~0_In-1292904132 |P2Thread1of1ForFork1_#t~ite42_Out-1292904132|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1292904132|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1292904132, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1292904132} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1292904132|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1292904132, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1292904132} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-26 21:12:09,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1994584341 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1994584341 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1994584341 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1994584341 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out1994584341|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In1994584341 |P2Thread1of1ForFork1_#t~ite43_Out1994584341|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1994584341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1994584341, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1994584341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1994584341} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1994584341|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1994584341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1994584341, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1994584341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1994584341} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 21:12:09,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 21:12:09,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-260447563 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-260447563 256)))) (or (and (= ~a$w_buff0_used~0_In-260447563 |P0Thread1of1ForFork2_#t~ite5_Out-260447563|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-260447563|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-260447563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-260447563} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-260447563|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-260447563, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-260447563} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 21:12:09,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In693068132 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In693068132 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In693068132 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In693068132 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In693068132 |P0Thread1of1ForFork2_#t~ite6_Out693068132|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork2_#t~ite6_Out693068132| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In693068132, ~a$w_buff0_used~0=~a$w_buff0_used~0_In693068132, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In693068132, ~a$w_buff1_used~0=~a$w_buff1_used~0_In693068132} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In693068132, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out693068132|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In693068132, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In693068132, ~a$w_buff1_used~0=~a$w_buff1_used~0_In693068132} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 21:12:09,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1481721515 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1481721515 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1481721515 ~a$r_buff0_thd1~0_Out-1481721515)) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-1481721515) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481721515, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1481721515} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1481721515|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481721515, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1481721515} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:12:09,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In243148168 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In243148168 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In243148168 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In243148168 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out243148168| ~a$r_buff1_thd1~0_In243148168) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork2_#t~ite8_Out243148168|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In243148168, ~a$w_buff0_used~0=~a$w_buff0_used~0_In243148168, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In243148168, ~a$w_buff1_used~0=~a$w_buff1_used~0_In243148168} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out243148168|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In243148168, ~a$w_buff0_used~0=~a$w_buff0_used~0_In243148168, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In243148168, ~a$w_buff1_used~0=~a$w_buff1_used~0_In243148168} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 21:12:09,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:12:09,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:12:09,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-8236162 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-8236162 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-8236162| ~a~0_In-8236162) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-8236162| ~a$w_buff1~0_In-8236162)))) InVars {~a~0=~a~0_In-8236162, ~a$w_buff1~0=~a$w_buff1~0_In-8236162, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-8236162, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8236162} OutVars{~a~0=~a~0_In-8236162, ~a$w_buff1~0=~a$w_buff1~0_In-8236162, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-8236162|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-8236162, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8236162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:12:09,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:12:09,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1045500993 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1045500993 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1045500993|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1045500993 |ULTIMATE.start_main_#t~ite49_Out1045500993|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1045500993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1045500993} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1045500993, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1045500993|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1045500993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:12:09,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-563989013 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-563989013 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-563989013 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-563989013 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-563989013| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-563989013| ~a$w_buff1_used~0_In-563989013) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-563989013, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-563989013, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-563989013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-563989013} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-563989013|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-563989013, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-563989013, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-563989013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-563989013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:12:09,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-756370428 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-756370428 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-756370428 |ULTIMATE.start_main_#t~ite51_Out-756370428|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-756370428|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-756370428, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-756370428} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-756370428|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-756370428, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-756370428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:12:09,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In510556364 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In510556364 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In510556364 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In510556364 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out510556364| ~a$r_buff1_thd0~0_In510556364)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out510556364| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In510556364, ~a$w_buff0_used~0=~a$w_buff0_used~0_In510556364, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In510556364, ~a$w_buff1_used~0=~a$w_buff1_used~0_In510556364} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out510556364|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In510556364, ~a$w_buff0_used~0=~a$w_buff0_used~0_In510556364, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In510556364, ~a$w_buff1_used~0=~a$w_buff1_used~0_In510556364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:12:09,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~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:12:09,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:12:09 BasicIcfg [2019-12-26 21:12:09,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:12:09,427 INFO L168 Benchmark]: Toolchain (without parser) took 143028.98 ms. Allocated memory was 147.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 102.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,428 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.44 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 156.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.51 ms. Allocated memory is still 204.5 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,429 INFO L168 Benchmark]: Boogie Preprocessor took 43.92 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,430 INFO L168 Benchmark]: RCFGBuilder took 867.59 ms. Allocated memory is still 204.5 MB. Free memory was 151.7 MB in the beginning and 100.8 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,430 INFO L168 Benchmark]: TraceAbstraction took 141272.17 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 21:12:09,433 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.48 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.44 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 156.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.51 ms. Allocated memory is still 204.5 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.92 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.59 ms. Allocated memory is still 204.5 MB. Free memory was 151.7 MB in the beginning and 100.8 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141272.17 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t50, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 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_p1_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t51, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, z=0] [L783] EXPR 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_p1_EAX=1, __unbuffered_p1_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=1, z=0] [L760] 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) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 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 [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t52, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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) [L808] 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)) [L809] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1] [L809] 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)) [L810] 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)) [L811] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=1, y=1, z=1] [L811] 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)) [L813] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1] [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 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 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 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 [L852] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __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=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=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 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 [L855] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.8s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 65.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9031 SDtfs, 13492 SDslu, 40116 SDs, 0 SdLazy, 38538 SolverSat, 818 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 716 GetRequests, 54 SyntacticMatches, 27 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4763 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 364850 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1887 NumberOfCodeBlocks, 1887 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1785 ConstructedInterpolants, 0 QuantifiedInterpolants, 658688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...