/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/safe026_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:04:38,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:04:38,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:04:38,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:04:38,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:04:38,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:04:38,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:04:38,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:04:38,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:04:38,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:04:38,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:04:38,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:04:38,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:04:38,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:04:38,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:04:38,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:04:38,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:04:38,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:04:38,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:04:38,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:04:38,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:04:38,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:04:38,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:04:38,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:04:38,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:04:38,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:04:38,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:04:38,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:04:38,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:04:38,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:04:38,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:04:38,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:04:38,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:04:38,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:04:38,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:04:38,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:04:38,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:04:38,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:04:38,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:04:38,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:04:38,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:04:38,238 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-27 00:04:38,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:04:38,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:04:38,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:04:38,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:04:38,259 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:04:38,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:04:38,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:04:38,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:04:38,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:04:38,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:04:38,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:04:38,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:04:38,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:04:38,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:04:38,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:04:38,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:04:38,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:04:38,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:04:38,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:04:38,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:04:38,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:04:38,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:04:38,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:04:38,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:04:38,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:04:38,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:04:38,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:04:38,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:04:38,265 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:04:38,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:04:38,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:04:38,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:04:38,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:04:38,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:04:38,556 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:04:38,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-27 00:04:38,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16be793a1/f5039ac3c13845dcae615004a75d9f9f/FLAG5e3c84a8c [2019-12-27 00:04:39,158 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:04:39,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-27 00:04:39,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16be793a1/f5039ac3c13845dcae615004a75d9f9f/FLAG5e3c84a8c [2019-12-27 00:04:39,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16be793a1/f5039ac3c13845dcae615004a75d9f9f [2019-12-27 00:04:39,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:04:39,459 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:04:39,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:04:39,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:04:39,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:04:39,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:04:39" (1/1) ... [2019-12-27 00:04:39,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:39, skipping insertion in model container [2019-12-27 00:04:39,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:04:39" (1/1) ... [2019-12-27 00:04:39,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:04:39,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:04:40,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:04:40,107 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:04:40,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:04:40,260 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:04:40,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40 WrapperNode [2019-12-27 00:04:40,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:04:40,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:04:40,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:04:40,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:04:40,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:04:40,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:04:40,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:04:40,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:04:40,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... [2019-12-27 00:04:40,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:04:40,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:04:40,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:04:40,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:04:40,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:04:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:04:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:04:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:04:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:04:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:04:40,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:04:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:04:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:04:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:04:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:04:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:04:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:04:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:04:40,453 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:04:41,346 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:04:41,346 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:04:41,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:04:41 BoogieIcfgContainer [2019-12-27 00:04:41,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:04:41,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:04:41,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:04:41,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:04:41,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:04:39" (1/3) ... [2019-12-27 00:04:41,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e723d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:04:41, skipping insertion in model container [2019-12-27 00:04:41,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:04:40" (2/3) ... [2019-12-27 00:04:41,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e723d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:04:41, skipping insertion in model container [2019-12-27 00:04:41,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:04:41" (3/3) ... [2019-12-27 00:04:41,357 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2019-12-27 00:04:41,370 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:04:41,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:04:41,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:04:41,379 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:04:41,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,424 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,424 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,456 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:04:41,549 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:04:41,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:04:41,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:04:41,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:04:41,571 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:04:41,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:04:41,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:04:41,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:04:41,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:04:41,594 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 00:04:41,596 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 00:04:41,735 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 00:04:41,735 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:04:41,756 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 00:04:41,780 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 00:04:41,837 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 00:04:41,837 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:04:41,845 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 00:04:41,867 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 00:04:41,868 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:04:46,828 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 00:04:47,314 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 00:04:47,457 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 00:04:47,499 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-27 00:04:47,499 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 00:04:47,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-27 00:05:03,259 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 00:05:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 00:05:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:05:03,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:03,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:05:03,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-27 00:05:03,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:03,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592428009] [2019-12-27 00:05:03,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:03,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592428009] [2019-12-27 00:05:03,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:03,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:05:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800777488] [2019-12-27 00:05:03,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:05:03,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:03,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:05:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:05:03,548 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 00:05:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:06,506 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-27 00:05:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:05:06,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:05:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:07,270 INFO L225 Difference]: With dead ends: 108680 [2019-12-27 00:05:07,271 INFO L226 Difference]: Without dead ends: 102440 [2019-12-27 00:05:07,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:05:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-27 00:05:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-27 00:05:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-27 00:05:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-27 00:05:18,514 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-27 00:05:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:18,515 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-27 00:05:18,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:05:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-27 00:05:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:05:18,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:18,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:18,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-27 00:05:18,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:18,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557717126] [2019-12-27 00:05:18,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:18,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557717126] [2019-12-27 00:05:18,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:18,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:05:18,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765163912] [2019-12-27 00:05:18,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:05:18,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:05:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:05:18,711 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-27 00:05:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:24,456 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-27 00:05:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:05:24,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 00:05:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:25,093 INFO L225 Difference]: With dead ends: 163248 [2019-12-27 00:05:25,094 INFO L226 Difference]: Without dead ends: 163199 [2019-12-27 00:05:25,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:05:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-27 00:05:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-27 00:05:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-27 00:05:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-27 00:05:39,934 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-27 00:05:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:39,935 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-27 00:05:39,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:05:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-27 00:05:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:05:39,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:39,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:39,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-27 00:05:39,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:39,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996644598] [2019-12-27 00:05:39,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:40,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996644598] [2019-12-27 00:05:40,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:40,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:05:40,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098576981] [2019-12-27 00:05:40,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:05:40,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:40,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:05:40,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:05:40,083 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-27 00:05:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:40,312 INFO L93 Difference]: Finished difference Result 43706 states and 149507 transitions. [2019-12-27 00:05:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:05:40,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:05:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:40,417 INFO L225 Difference]: With dead ends: 43706 [2019-12-27 00:05:40,417 INFO L226 Difference]: Without dead ends: 33577 [2019-12-27 00:05:40,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:05:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33577 states. [2019-12-27 00:05:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33577 to 33481. [2019-12-27 00:05:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33481 states. [2019-12-27 00:05:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33481 states to 33481 states and 108822 transitions. [2019-12-27 00:05:41,156 INFO L78 Accepts]: Start accepts. Automaton has 33481 states and 108822 transitions. Word has length 13 [2019-12-27 00:05:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:41,157 INFO L462 AbstractCegarLoop]: Abstraction has 33481 states and 108822 transitions. [2019-12-27 00:05:41,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:05:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 33481 states and 108822 transitions. [2019-12-27 00:05:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:05:41,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:41,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:41,161 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-27 00:05:41,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:41,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307166633] [2019-12-27 00:05:41,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:41,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307166633] [2019-12-27 00:05:41,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:41,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:05:41,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279325127] [2019-12-27 00:05:41,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:05:41,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:05:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:05:41,256 INFO L87 Difference]: Start difference. First operand 33481 states and 108822 transitions. Second operand 5 states. [2019-12-27 00:05:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:41,800 INFO L93 Difference]: Finished difference Result 45175 states and 144711 transitions. [2019-12-27 00:05:41,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:05:41,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 00:05:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:41,931 INFO L225 Difference]: With dead ends: 45175 [2019-12-27 00:05:41,931 INFO L226 Difference]: Without dead ends: 45175 [2019-12-27 00:05:41,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:05:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45175 states. [2019-12-27 00:05:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45175 to 38347. [2019-12-27 00:05:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-27 00:05:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-27 00:05:44,015 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 16 [2019-12-27 00:05:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:44,015 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-27 00:05:44,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:05:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-27 00:05:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:05:44,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:44,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:44,025 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-27 00:05:44,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:44,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733259276] [2019-12-27 00:05:44,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:44,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733259276] [2019-12-27 00:05:44,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:44,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:05:44,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896370046] [2019-12-27 00:05:44,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:05:44,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:05:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:05:44,142 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-27 00:05:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:45,105 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-27 00:05:45,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:05:45,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:05:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:45,214 INFO L225 Difference]: With dead ends: 58112 [2019-12-27 00:05:45,214 INFO L226 Difference]: Without dead ends: 58056 [2019-12-27 00:05:45,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:05:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-27 00:05:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-27 00:05:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-27 00:05:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-27 00:05:46,828 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-27 00:05:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:46,828 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-27 00:05:46,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:05:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-27 00:05:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:05:46,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:46,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:46,842 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-27 00:05:46,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:46,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665539308] [2019-12-27 00:05:46,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:47,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665539308] [2019-12-27 00:05:47,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:47,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:05:47,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897628148] [2019-12-27 00:05:47,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:05:47,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:47,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:05:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:05:47,110 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 7 states. [2019-12-27 00:05:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:48,131 INFO L93 Difference]: Finished difference Result 54188 states and 170191 transitions. [2019-12-27 00:05:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:05:48,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 00:05:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:48,217 INFO L225 Difference]: With dead ends: 54188 [2019-12-27 00:05:48,218 INFO L226 Difference]: Without dead ends: 54175 [2019-12-27 00:05:48,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:05:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54175 states. [2019-12-27 00:05:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54175 to 45950. [2019-12-27 00:05:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45950 states. [2019-12-27 00:05:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45950 states to 45950 states and 146719 transitions. [2019-12-27 00:05:49,854 INFO L78 Accepts]: Start accepts. Automaton has 45950 states and 146719 transitions. Word has length 25 [2019-12-27 00:05:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:49,855 INFO L462 AbstractCegarLoop]: Abstraction has 45950 states and 146719 transitions. [2019-12-27 00:05:49,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:05:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45950 states and 146719 transitions. [2019-12-27 00:05:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:05:49,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:49,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:49,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-27 00:05:49,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:49,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314663258] [2019-12-27 00:05:49,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:49,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314663258] [2019-12-27 00:05:49,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:49,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:05:49,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024309936] [2019-12-27 00:05:49,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:05:49,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:05:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:05:49,994 INFO L87 Difference]: Start difference. First operand 45950 states and 146719 transitions. Second operand 6 states. [2019-12-27 00:05:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:50,810 INFO L93 Difference]: Finished difference Result 65294 states and 203497 transitions. [2019-12-27 00:05:50,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 00:05:50,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 00:05:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:50,911 INFO L225 Difference]: With dead ends: 65294 [2019-12-27 00:05:50,912 INFO L226 Difference]: Without dead ends: 64946 [2019-12-27 00:05:50,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 00:05:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64946 states. [2019-12-27 00:05:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64946 to 50721. [2019-12-27 00:05:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50721 states. [2019-12-27 00:05:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50721 states to 50721 states and 161063 transitions. [2019-12-27 00:05:54,614 INFO L78 Accepts]: Start accepts. Automaton has 50721 states and 161063 transitions. Word has length 27 [2019-12-27 00:05:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:54,615 INFO L462 AbstractCegarLoop]: Abstraction has 50721 states and 161063 transitions. [2019-12-27 00:05:54,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:05:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50721 states and 161063 transitions. [2019-12-27 00:05:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 00:05:54,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:54,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:05:54,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash 312672747, now seen corresponding path program 1 times [2019-12-27 00:05:54,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:54,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315687239] [2019-12-27 00:05:54,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:54,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315687239] [2019-12-27 00:05:54,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:54,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:05:54,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913025517] [2019-12-27 00:05:54,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:05:54,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:54,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:05:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:05:54,687 INFO L87 Difference]: Start difference. First operand 50721 states and 161063 transitions. Second operand 3 states. [2019-12-27 00:05:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:54,938 INFO L93 Difference]: Finished difference Result 50670 states and 160911 transitions. [2019-12-27 00:05:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:05:54,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 00:05:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:55,068 INFO L225 Difference]: With dead ends: 50670 [2019-12-27 00:05:55,068 INFO L226 Difference]: Without dead ends: 50670 [2019-12-27 00:05:55,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:05:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50670 states. [2019-12-27 00:05:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50670 to 50670. [2019-12-27 00:05:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50670 states. [2019-12-27 00:05:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50670 states to 50670 states and 160911 transitions. [2019-12-27 00:05:55,975 INFO L78 Accepts]: Start accepts. Automaton has 50670 states and 160911 transitions. Word has length 28 [2019-12-27 00:05:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:55,975 INFO L462 AbstractCegarLoop]: Abstraction has 50670 states and 160911 transitions. [2019-12-27 00:05:55,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:05:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50670 states and 160911 transitions. [2019-12-27 00:05:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 00:05:55,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:55,992 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] [2019-12-27 00:05:55,993 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash -524022794, now seen corresponding path program 1 times [2019-12-27 00:05:55,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:55,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741001742] [2019-12-27 00:05:55,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:56,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741001742] [2019-12-27 00:05:56,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:56,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:05:56,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988086456] [2019-12-27 00:05:56,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:05:56,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:05:56,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:05:56,060 INFO L87 Difference]: Start difference. First operand 50670 states and 160911 transitions. Second operand 4 states. [2019-12-27 00:05:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:56,993 INFO L93 Difference]: Finished difference Result 128654 states and 414338 transitions. [2019-12-27 00:05:56,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:05:56,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 00:05:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:57,068 INFO L225 Difference]: With dead ends: 128654 [2019-12-27 00:05:57,068 INFO L226 Difference]: Without dead ends: 38433 [2019-12-27 00:05:57,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:05:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38433 states. [2019-12-27 00:05:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38433 to 37586. [2019-12-27 00:05:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37586 states. [2019-12-27 00:05:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37586 states to 37586 states and 117828 transitions. [2019-12-27 00:05:57,717 INFO L78 Accepts]: Start accepts. Automaton has 37586 states and 117828 transitions. Word has length 29 [2019-12-27 00:05:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:57,717 INFO L462 AbstractCegarLoop]: Abstraction has 37586 states and 117828 transitions. [2019-12-27 00:05:57,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:05:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 37586 states and 117828 transitions. [2019-12-27 00:05:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:05:57,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:57,733 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] [2019-12-27 00:05:57,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash -116284186, now seen corresponding path program 1 times [2019-12-27 00:05:57,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:57,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091225317] [2019-12-27 00:05:57,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:57,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091225317] [2019-12-27 00:05:57,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:57,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:05:57,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791514135] [2019-12-27 00:05:57,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:05:57,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:05:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:05:57,814 INFO L87 Difference]: Start difference. First operand 37586 states and 117828 transitions. Second operand 5 states. [2019-12-27 00:05:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:05:58,481 INFO L93 Difference]: Finished difference Result 53350 states and 166217 transitions. [2019-12-27 00:05:58,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:05:58,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 00:05:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:05:58,574 INFO L225 Difference]: With dead ends: 53350 [2019-12-27 00:05:58,574 INFO L226 Difference]: Without dead ends: 53350 [2019-12-27 00:05:58,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:05:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53350 states. [2019-12-27 00:05:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53350 to 46567. [2019-12-27 00:05:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46567 states. [2019-12-27 00:05:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46567 states to 46567 states and 146175 transitions. [2019-12-27 00:05:59,841 INFO L78 Accepts]: Start accepts. Automaton has 46567 states and 146175 transitions. Word has length 30 [2019-12-27 00:05:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:05:59,841 INFO L462 AbstractCegarLoop]: Abstraction has 46567 states and 146175 transitions. [2019-12-27 00:05:59,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:05:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 46567 states and 146175 transitions. [2019-12-27 00:05:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:05:59,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:05:59,865 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] [2019-12-27 00:05:59,865 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:05:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:05:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1132903455, now seen corresponding path program 1 times [2019-12-27 00:05:59,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:05:59,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659094255] [2019-12-27 00:05:59,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:05:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:05:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:05:59,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659094255] [2019-12-27 00:05:59,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:05:59,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:05:59,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672026242] [2019-12-27 00:05:59,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:05:59,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:05:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:05:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:05:59,940 INFO L87 Difference]: Start difference. First operand 46567 states and 146175 transitions. Second operand 3 states. [2019-12-27 00:06:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:00,173 INFO L93 Difference]: Finished difference Result 46567 states and 144772 transitions. [2019-12-27 00:06:00,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:06:00,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 00:06:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:00,272 INFO L225 Difference]: With dead ends: 46567 [2019-12-27 00:06:00,272 INFO L226 Difference]: Without dead ends: 46567 [2019-12-27 00:06:00,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46567 states. [2019-12-27 00:06:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46567 to 45990. [2019-12-27 00:06:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45990 states. [2019-12-27 00:06:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45990 states to 45990 states and 143118 transitions. [2019-12-27 00:06:00,999 INFO L78 Accepts]: Start accepts. Automaton has 45990 states and 143118 transitions. Word has length 30 [2019-12-27 00:06:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:00,999 INFO L462 AbstractCegarLoop]: Abstraction has 45990 states and 143118 transitions. [2019-12-27 00:06:00,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:06:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 45990 states and 143118 transitions. [2019-12-27 00:06:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 00:06:01,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:01,018 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] [2019-12-27 00:06:01,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1026319235, now seen corresponding path program 1 times [2019-12-27 00:06:01,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:01,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223285986] [2019-12-27 00:06:01,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:01,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223285986] [2019-12-27 00:06:01,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:01,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:06:01,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835110442] [2019-12-27 00:06:01,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:06:01,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:06:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:06:01,099 INFO L87 Difference]: Start difference. First operand 45990 states and 143118 transitions. Second operand 5 states. [2019-12-27 00:06:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:01,208 INFO L93 Difference]: Finished difference Result 23030 states and 67473 transitions. [2019-12-27 00:06:01,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:06:01,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 00:06:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:01,234 INFO L225 Difference]: With dead ends: 23030 [2019-12-27 00:06:01,234 INFO L226 Difference]: Without dead ends: 20044 [2019-12-27 00:06:01,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:06:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20044 states. [2019-12-27 00:06:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20044 to 18831. [2019-12-27 00:06:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 00:06:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 55155 transitions. [2019-12-27 00:06:01,500 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 55155 transitions. Word has length 31 [2019-12-27 00:06:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:01,501 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 55155 transitions. [2019-12-27 00:06:01,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:06:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 55155 transitions. [2019-12-27 00:06:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 00:06:01,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:01,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:01,513 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-27 00:06:01,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:01,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844461534] [2019-12-27 00:06:01,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:01,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844461534] [2019-12-27 00:06:01,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:01,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:06:01,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114489194] [2019-12-27 00:06:01,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:06:01,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:06:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:06:01,980 INFO L87 Difference]: Start difference. First operand 18831 states and 55155 transitions. Second operand 7 states. [2019-12-27 00:06:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:02,976 INFO L93 Difference]: Finished difference Result 26867 states and 76360 transitions. [2019-12-27 00:06:02,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:06:02,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 00:06:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:03,010 INFO L225 Difference]: With dead ends: 26867 [2019-12-27 00:06:03,010 INFO L226 Difference]: Without dead ends: 26180 [2019-12-27 00:06:03,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 00:06:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26180 states. [2019-12-27 00:06:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26180 to 17921. [2019-12-27 00:06:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17921 states. [2019-12-27 00:06:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17921 states to 17921 states and 52252 transitions. [2019-12-27 00:06:03,302 INFO L78 Accepts]: Start accepts. Automaton has 17921 states and 52252 transitions. Word has length 33 [2019-12-27 00:06:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:03,303 INFO L462 AbstractCegarLoop]: Abstraction has 17921 states and 52252 transitions. [2019-12-27 00:06:03,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:06:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17921 states and 52252 transitions. [2019-12-27 00:06:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:06:03,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:03,318 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-27 00:06:03,319 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1835008453, now seen corresponding path program 1 times [2019-12-27 00:06:03,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:03,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335747986] [2019-12-27 00:06:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:03,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335747986] [2019-12-27 00:06:03,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:03,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:06:03,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954146252] [2019-12-27 00:06:03,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:06:03,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:06:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:03,393 INFO L87 Difference]: Start difference. First operand 17921 states and 52252 transitions. Second operand 3 states. [2019-12-27 00:06:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:03,466 INFO L93 Difference]: Finished difference Result 17846 states and 52020 transitions. [2019-12-27 00:06:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:06:03,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 00:06:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:03,496 INFO L225 Difference]: With dead ends: 17846 [2019-12-27 00:06:03,497 INFO L226 Difference]: Without dead ends: 17846 [2019-12-27 00:06:03,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17846 states. [2019-12-27 00:06:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17846 to 14279. [2019-12-27 00:06:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14279 states. [2019-12-27 00:06:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14279 states to 14279 states and 42249 transitions. [2019-12-27 00:06:03,881 INFO L78 Accepts]: Start accepts. Automaton has 14279 states and 42249 transitions. Word has length 41 [2019-12-27 00:06:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:03,882 INFO L462 AbstractCegarLoop]: Abstraction has 14279 states and 42249 transitions. [2019-12-27 00:06:03,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:06:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 14279 states and 42249 transitions. [2019-12-27 00:06:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:06:03,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:03,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:03,905 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-27 00:06:03,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:03,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811905500] [2019-12-27 00:06:03,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:03,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811905500] [2019-12-27 00:06:03,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:03,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:06:03,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333369260] [2019-12-27 00:06:03,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:06:03,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:03,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:06:03,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:06:03,991 INFO L87 Difference]: Start difference. First operand 14279 states and 42249 transitions. Second operand 6 states. [2019-12-27 00:06:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:04,103 INFO L93 Difference]: Finished difference Result 13333 states and 40178 transitions. [2019-12-27 00:06:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:06:04,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 00:06:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:04,124 INFO L225 Difference]: With dead ends: 13333 [2019-12-27 00:06:04,124 INFO L226 Difference]: Without dead ends: 11632 [2019-12-27 00:06:04,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:06:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11632 states. [2019-12-27 00:06:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11632 to 11632. [2019-12-27 00:06:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11632 states. [2019-12-27 00:06:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11632 states to 11632 states and 36045 transitions. [2019-12-27 00:06:04,377 INFO L78 Accepts]: Start accepts. Automaton has 11632 states and 36045 transitions. Word has length 42 [2019-12-27 00:06:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:04,378 INFO L462 AbstractCegarLoop]: Abstraction has 11632 states and 36045 transitions. [2019-12-27 00:06:04,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:06:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 11632 states and 36045 transitions. [2019-12-27 00:06:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:04,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:04,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:04,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:04,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-27 00:06:04,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:04,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38643294] [2019-12-27 00:06:04,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:04,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38643294] [2019-12-27 00:06:04,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:04,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:06:04,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954597602] [2019-12-27 00:06:04,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:06:04,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:06:04,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:04,436 INFO L87 Difference]: Start difference. First operand 11632 states and 36045 transitions. Second operand 3 states. [2019-12-27 00:06:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:04,536 INFO L93 Difference]: Finished difference Result 17477 states and 54237 transitions. [2019-12-27 00:06:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:06:04,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 00:06:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:04,560 INFO L225 Difference]: With dead ends: 17477 [2019-12-27 00:06:04,560 INFO L226 Difference]: Without dead ends: 17477 [2019-12-27 00:06:04,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2019-12-27 00:06:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 14068. [2019-12-27 00:06:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14068 states. [2019-12-27 00:06:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14068 states to 14068 states and 44017 transitions. [2019-12-27 00:06:04,801 INFO L78 Accepts]: Start accepts. Automaton has 14068 states and 44017 transitions. Word has length 66 [2019-12-27 00:06:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:04,801 INFO L462 AbstractCegarLoop]: Abstraction has 14068 states and 44017 transitions. [2019-12-27 00:06:04,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:06:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 14068 states and 44017 transitions. [2019-12-27 00:06:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:04,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:04,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:04,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-27 00:06:04,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:04,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132140578] [2019-12-27 00:06:04,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:04,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132140578] [2019-12-27 00:06:04,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:04,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:06:04,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518561483] [2019-12-27 00:06:04,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:06:04,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:06:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:04,869 INFO L87 Difference]: Start difference. First operand 14068 states and 44017 transitions. Second operand 3 states. [2019-12-27 00:06:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:04,988 INFO L93 Difference]: Finished difference Result 17165 states and 51741 transitions. [2019-12-27 00:06:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:06:04,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 00:06:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:05,020 INFO L225 Difference]: With dead ends: 17165 [2019-12-27 00:06:05,020 INFO L226 Difference]: Without dead ends: 17165 [2019-12-27 00:06:05,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:06:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17165 states. [2019-12-27 00:06:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17165 to 13540. [2019-12-27 00:06:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13540 states. [2019-12-27 00:06:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13540 states to 13540 states and 40921 transitions. [2019-12-27 00:06:05,498 INFO L78 Accepts]: Start accepts. Automaton has 13540 states and 40921 transitions. Word has length 66 [2019-12-27 00:06:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:05,499 INFO L462 AbstractCegarLoop]: Abstraction has 13540 states and 40921 transitions. [2019-12-27 00:06:05,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:06:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 13540 states and 40921 transitions. [2019-12-27 00:06:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:05,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:05,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:05,513 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:05,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-27 00:06:05,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:05,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209386043] [2019-12-27 00:06:05,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:05,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209386043] [2019-12-27 00:06:05,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:05,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:06:05,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914243991] [2019-12-27 00:06:05,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:06:05,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:06:05,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:06:05,616 INFO L87 Difference]: Start difference. First operand 13540 states and 40921 transitions. Second operand 7 states. [2019-12-27 00:06:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:06,046 INFO L93 Difference]: Finished difference Result 41609 states and 124079 transitions. [2019-12-27 00:06:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:06:06,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 00:06:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:06,084 INFO L225 Difference]: With dead ends: 41609 [2019-12-27 00:06:06,085 INFO L226 Difference]: Without dead ends: 29429 [2019-12-27 00:06:06,085 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-27 00:06:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29429 states. [2019-12-27 00:06:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29429 to 16639. [2019-12-27 00:06:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16639 states. [2019-12-27 00:06:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16639 states to 16639 states and 49660 transitions. [2019-12-27 00:06:06,423 INFO L78 Accepts]: Start accepts. Automaton has 16639 states and 49660 transitions. Word has length 66 [2019-12-27 00:06:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:06,423 INFO L462 AbstractCegarLoop]: Abstraction has 16639 states and 49660 transitions. [2019-12-27 00:06:06,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:06:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 16639 states and 49660 transitions. [2019-12-27 00:06:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:06,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:06,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:06,440 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:06,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-27 00:06:06,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:06,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614459355] [2019-12-27 00:06:06,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:06,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614459355] [2019-12-27 00:06:06,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:06,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:06:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502461964] [2019-12-27 00:06:06,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:06:06,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:06,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:06:06,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:06:06,550 INFO L87 Difference]: Start difference. First operand 16639 states and 49660 transitions. Second operand 8 states. [2019-12-27 00:06:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:08,058 INFO L93 Difference]: Finished difference Result 26303 states and 76941 transitions. [2019-12-27 00:06:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 00:06:08,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 00:06:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:08,092 INFO L225 Difference]: With dead ends: 26303 [2019-12-27 00:06:08,092 INFO L226 Difference]: Without dead ends: 26087 [2019-12-27 00:06:08,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:06:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26087 states. [2019-12-27 00:06:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26087 to 16609. [2019-12-27 00:06:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16609 states. [2019-12-27 00:06:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16609 states to 16609 states and 49585 transitions. [2019-12-27 00:06:08,392 INFO L78 Accepts]: Start accepts. Automaton has 16609 states and 49585 transitions. Word has length 66 [2019-12-27 00:06:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:08,392 INFO L462 AbstractCegarLoop]: Abstraction has 16609 states and 49585 transitions. [2019-12-27 00:06:08,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:06:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16609 states and 49585 transitions. [2019-12-27 00:06:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:08,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:08,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:08,409 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1259142147, now seen corresponding path program 3 times [2019-12-27 00:06:08,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:08,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694215241] [2019-12-27 00:06:08,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:08,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694215241] [2019-12-27 00:06:08,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:08,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:06:08,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30059236] [2019-12-27 00:06:08,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:06:08,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:08,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:06:08,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:06:08,733 INFO L87 Difference]: Start difference. First operand 16609 states and 49585 transitions. Second operand 11 states. [2019-12-27 00:06:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:10,173 INFO L93 Difference]: Finished difference Result 40923 states and 122175 transitions. [2019-12-27 00:06:10,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 00:06:10,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 00:06:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:10,229 INFO L225 Difference]: With dead ends: 40923 [2019-12-27 00:06:10,229 INFO L226 Difference]: Without dead ends: 38356 [2019-12-27 00:06:10,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:06:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38356 states. [2019-12-27 00:06:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38356 to 21633. [2019-12-27 00:06:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21633 states. [2019-12-27 00:06:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21633 states to 21633 states and 64233 transitions. [2019-12-27 00:06:10,843 INFO L78 Accepts]: Start accepts. Automaton has 21633 states and 64233 transitions. Word has length 66 [2019-12-27 00:06:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:10,844 INFO L462 AbstractCegarLoop]: Abstraction has 21633 states and 64233 transitions. [2019-12-27 00:06:10,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:06:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21633 states and 64233 transitions. [2019-12-27 00:06:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:10,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:10,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:10,864 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash -94146317, now seen corresponding path program 4 times [2019-12-27 00:06:10,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:10,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983531256] [2019-12-27 00:06:10,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:11,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983531256] [2019-12-27 00:06:11,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:11,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:06:11,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231174040] [2019-12-27 00:06:11,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:06:11,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:11,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:06:11,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:06:11,089 INFO L87 Difference]: Start difference. First operand 21633 states and 64233 transitions. Second operand 11 states. [2019-12-27 00:06:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:12,312 INFO L93 Difference]: Finished difference Result 39097 states and 115175 transitions. [2019-12-27 00:06:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:06:12,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 00:06:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:12,355 INFO L225 Difference]: With dead ends: 39097 [2019-12-27 00:06:12,355 INFO L226 Difference]: Without dead ends: 29129 [2019-12-27 00:06:12,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:06:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29129 states. [2019-12-27 00:06:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29129 to 16413. [2019-12-27 00:06:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16413 states. [2019-12-27 00:06:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16413 states to 16413 states and 48488 transitions. [2019-12-27 00:06:12,689 INFO L78 Accepts]: Start accepts. Automaton has 16413 states and 48488 transitions. Word has length 66 [2019-12-27 00:06:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:12,689 INFO L462 AbstractCegarLoop]: Abstraction has 16413 states and 48488 transitions. [2019-12-27 00:06:12,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:06:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 16413 states and 48488 transitions. [2019-12-27 00:06:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:12,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:12,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:12,711 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -617468203, now seen corresponding path program 5 times [2019-12-27 00:06:12,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:12,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836379402] [2019-12-27 00:06:12,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:12,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836379402] [2019-12-27 00:06:12,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:12,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:06:12,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926822718] [2019-12-27 00:06:12,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:06:12,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:06:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:06:12,830 INFO L87 Difference]: Start difference. First operand 16413 states and 48488 transitions. Second operand 9 states. [2019-12-27 00:06:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:14,132 INFO L93 Difference]: Finished difference Result 23599 states and 69185 transitions. [2019-12-27 00:06:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:06:14,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 00:06:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:14,165 INFO L225 Difference]: With dead ends: 23599 [2019-12-27 00:06:14,165 INFO L226 Difference]: Without dead ends: 22660 [2019-12-27 00:06:14,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:06:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22660 states. [2019-12-27 00:06:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22660 to 16005. [2019-12-27 00:06:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16005 states. [2019-12-27 00:06:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16005 states to 16005 states and 47311 transitions. [2019-12-27 00:06:14,476 INFO L78 Accepts]: Start accepts. Automaton has 16005 states and 47311 transitions. Word has length 66 [2019-12-27 00:06:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:14,476 INFO L462 AbstractCegarLoop]: Abstraction has 16005 states and 47311 transitions. [2019-12-27 00:06:14,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:06:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16005 states and 47311 transitions. [2019-12-27 00:06:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 00:06:14,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:14,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:14,493 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 640702257, now seen corresponding path program 6 times [2019-12-27 00:06:14,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:14,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333878607] [2019-12-27 00:06:14,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:14,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333878607] [2019-12-27 00:06:14,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:14,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:06:14,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526738088] [2019-12-27 00:06:14,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:06:14,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:06:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:06:14,584 INFO L87 Difference]: Start difference. First operand 16005 states and 47311 transitions. Second operand 4 states. [2019-12-27 00:06:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:14,726 INFO L93 Difference]: Finished difference Result 18376 states and 54542 transitions. [2019-12-27 00:06:14,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:06:14,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 00:06:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:14,758 INFO L225 Difference]: With dead ends: 18376 [2019-12-27 00:06:14,758 INFO L226 Difference]: Without dead ends: 18376 [2019-12-27 00:06:14,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:06:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18376 states. [2019-12-27 00:06:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18376 to 14080. [2019-12-27 00:06:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14080 states. [2019-12-27 00:06:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14080 states to 14080 states and 42068 transitions. [2019-12-27 00:06:15,250 INFO L78 Accepts]: Start accepts. Automaton has 14080 states and 42068 transitions. Word has length 66 [2019-12-27 00:06:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 14080 states and 42068 transitions. [2019-12-27 00:06:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:06:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 14080 states and 42068 transitions. [2019-12-27 00:06:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:06:15,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:15,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:15,267 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 1 times [2019-12-27 00:06:15,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:15,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349438781] [2019-12-27 00:06:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:15,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-27 00:06:15,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349438781] [2019-12-27 00:06:15,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:15,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:06:15,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946366679] [2019-12-27 00:06:15,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:06:15,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:06:15,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:06:15,518 INFO L87 Difference]: Start difference. First operand 14080 states and 42068 transitions. Second operand 12 states. [2019-12-27 00:06:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:16,580 INFO L93 Difference]: Finished difference Result 26525 states and 79224 transitions. [2019-12-27 00:06:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:06:16,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 00:06:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:16,620 INFO L225 Difference]: With dead ends: 26525 [2019-12-27 00:06:16,620 INFO L226 Difference]: Without dead ends: 26090 [2019-12-27 00:06:16,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:06:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26090 states. [2019-12-27 00:06:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26090 to 13820. [2019-12-27 00:06:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13820 states. [2019-12-27 00:06:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13820 states to 13820 states and 41412 transitions. [2019-12-27 00:06:16,933 INFO L78 Accepts]: Start accepts. Automaton has 13820 states and 41412 transitions. Word has length 67 [2019-12-27 00:06:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:16,933 INFO L462 AbstractCegarLoop]: Abstraction has 13820 states and 41412 transitions. [2019-12-27 00:06:16,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:06:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13820 states and 41412 transitions. [2019-12-27 00:06:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:06:16,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:16,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:16,950 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1771988187, now seen corresponding path program 1 times [2019-12-27 00:06:16,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:16,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446420979] [2019-12-27 00:06:16,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:17,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446420979] [2019-12-27 00:06:17,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:17,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:06:17,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168413242] [2019-12-27 00:06:17,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:06:17,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:06:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:06:17,155 INFO L87 Difference]: Start difference. First operand 13820 states and 41412 transitions. Second operand 11 states. [2019-12-27 00:06:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:19,672 INFO L93 Difference]: Finished difference Result 28407 states and 83530 transitions. [2019-12-27 00:06:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 00:06:19,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 00:06:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:19,712 INFO L225 Difference]: With dead ends: 28407 [2019-12-27 00:06:19,712 INFO L226 Difference]: Without dead ends: 28407 [2019-12-27 00:06:19,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-12-27 00:06:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28407 states. [2019-12-27 00:06:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28407 to 13676. [2019-12-27 00:06:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13676 states. [2019-12-27 00:06:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13676 states to 13676 states and 40725 transitions. [2019-12-27 00:06:20,007 INFO L78 Accepts]: Start accepts. Automaton has 13676 states and 40725 transitions. Word has length 67 [2019-12-27 00:06:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:20,007 INFO L462 AbstractCegarLoop]: Abstraction has 13676 states and 40725 transitions. [2019-12-27 00:06:20,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:06:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 13676 states and 40725 transitions. [2019-12-27 00:06:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:06:20,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:20,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:20,021 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1711385183, now seen corresponding path program 2 times [2019-12-27 00:06:20,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:20,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210018128] [2019-12-27 00:06:20,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:06:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:06:20,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210018128] [2019-12-27 00:06:20,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:06:20,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:06:20,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313871270] [2019-12-27 00:06:20,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:06:20,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:06:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:06:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:06:20,127 INFO L87 Difference]: Start difference. First operand 13676 states and 40725 transitions. Second operand 6 states. [2019-12-27 00:06:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:06:20,288 INFO L93 Difference]: Finished difference Result 13518 states and 40042 transitions. [2019-12-27 00:06:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:06:20,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 00:06:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:06:20,306 INFO L225 Difference]: With dead ends: 13518 [2019-12-27 00:06:20,307 INFO L226 Difference]: Without dead ends: 13518 [2019-12-27 00:06:20,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:06:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13518 states. [2019-12-27 00:06:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13518 to 12253. [2019-12-27 00:06:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12253 states. [2019-12-27 00:06:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12253 states to 12253 states and 36272 transitions. [2019-12-27 00:06:20,492 INFO L78 Accepts]: Start accepts. Automaton has 12253 states and 36272 transitions. Word has length 67 [2019-12-27 00:06:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:06:20,493 INFO L462 AbstractCegarLoop]: Abstraction has 12253 states and 36272 transitions. [2019-12-27 00:06:20,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:06:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12253 states and 36272 transitions. [2019-12-27 00:06:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 00:06:20,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:06:20,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:06:20,504 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:06:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:06:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 2 times [2019-12-27 00:06:20,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:06:20,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429293828] [2019-12-27 00:06:20,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:06:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:06:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:06:20,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:06:20,630 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:06:20,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:06:20,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:06:20,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-27 00:06:20,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-27 00:06:20,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-721567767 256)))) (or (and (= ~y$w_buff1~0_In-721567767 |P2Thread1of1ForFork2_#t~ite24_Out-721567767|) (= |P2Thread1of1ForFork2_#t~ite23_In-721567767| |P2Thread1of1ForFork2_#t~ite23_Out-721567767|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-721567767 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-721567767 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-721567767 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-721567767 256)) .cse1))) (= ~y$w_buff1~0_In-721567767 |P2Thread1of1ForFork2_#t~ite23_Out-721567767|) .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out-721567767| |P2Thread1of1ForFork2_#t~ite24_Out-721567767|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-721567767|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-721567767, ~y$w_buff1~0=~y$w_buff1~0_In-721567767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-721567767, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-721567767, ~weak$$choice2~0=~weak$$choice2~0_In-721567767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721567767} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-721567767|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-721567767|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-721567767, ~y$w_buff1~0=~y$w_buff1~0_In-721567767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-721567767, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-721567767, ~weak$$choice2~0=~weak$$choice2~0_In-721567767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721567767} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 00:06:20,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1426865004 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1426865004 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1426865004 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1426865004 256))) (= 0 (mod ~y$w_buff0_used~0_In1426865004 256)))) (= ~y$w_buff0_used~0_In1426865004 |P2Thread1of1ForFork2_#t~ite26_Out1426865004|) (= |P2Thread1of1ForFork2_#t~ite27_Out1426865004| |P2Thread1of1ForFork2_#t~ite26_Out1426865004|)) (and (= ~y$w_buff0_used~0_In1426865004 |P2Thread1of1ForFork2_#t~ite27_Out1426865004|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In1426865004| |P2Thread1of1ForFork2_#t~ite26_Out1426865004|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1426865004, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1426865004|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1426865004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1426865004, ~weak$$choice2~0=~weak$$choice2~0_In1426865004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1426865004} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1426865004|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1426865004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1426865004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1426865004, ~weak$$choice2~0=~weak$$choice2~0_In1426865004, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1426865004|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1426865004} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 00:06:20,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1272620357 256)))) (or (and (= ~y$w_buff1_used~0_In1272620357 |P2Thread1of1ForFork2_#t~ite30_Out1272620357|) (= |P2Thread1of1ForFork2_#t~ite29_In1272620357| |P2Thread1of1ForFork2_#t~ite29_Out1272620357|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1272620357 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1272620357 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1272620357 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1272620357 256))))) (= ~y$w_buff1_used~0_In1272620357 |P2Thread1of1ForFork2_#t~ite29_Out1272620357|) .cse0 (= |P2Thread1of1ForFork2_#t~ite30_Out1272620357| |P2Thread1of1ForFork2_#t~ite29_Out1272620357|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1272620357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1272620357, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1272620357, ~weak$$choice2~0=~weak$$choice2~0_In1272620357, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1272620357|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1272620357} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1272620357, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1272620357, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1272620357|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1272620357, ~weak$$choice2~0=~weak$$choice2~0_In1272620357, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1272620357|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1272620357} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 00:06:20,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 00:06:20,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 00:06:20,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In-770496185 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-770496185 256)))) (or (and (= ~y$w_buff1~0_In-770496185 |P2Thread1of1ForFork2_#t~ite38_Out-770496185|) (not .cse0) (not .cse1)) (and (= ~y~0_In-770496185 |P2Thread1of1ForFork2_#t~ite38_Out-770496185|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-770496185, ~y$w_buff1~0=~y$w_buff1~0_In-770496185, ~y~0=~y~0_In-770496185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-770496185} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-770496185, ~y$w_buff1~0=~y$w_buff1~0_In-770496185, ~y~0=~y~0_In-770496185, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-770496185|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-770496185} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 00:06:20,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-144727885 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-144727885 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-144727885|) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-144727885| ~y$w_buff0_used~0_In-144727885)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-144727885, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-144727885} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-144727885|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-144727885, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-144727885} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 00:06:20,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1452111878 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1452111878 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1452111878 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1452111878 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1452111878|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1452111878 |P0Thread1of1ForFork0_#t~ite6_Out1452111878|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1452111878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1452111878, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1452111878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1452111878} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1452111878|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1452111878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1452111878, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1452111878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1452111878} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 00:06:20,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1383295755 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1383295755 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out1383295755| |P1Thread1of1ForFork1_#t~ite10_Out1383295755|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1383295755| ~y$w_buff1~0_In1383295755) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1383295755| ~y~0_In1383295755) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1383295755, ~y$w_buff1~0=~y$w_buff1~0_In1383295755, ~y~0=~y~0_In1383295755, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1383295755} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1383295755, ~y$w_buff1~0=~y$w_buff1~0_In1383295755, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1383295755|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1383295755|, ~y~0=~y~0_In1383295755, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1383295755} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 00:06:20,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 00:06:20,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In231329871 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In231329871 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out231329871| ~y$w_buff0_used~0_In231329871)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out231329871| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In231329871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In231329871} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In231329871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In231329871, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out231329871|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 00:06:20,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In1062832802 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1062832802 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1062832802 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1062832802 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out1062832802| 0)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out1062832802| ~y$w_buff1_used~0_In1062832802) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1062832802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1062832802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062832802} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1062832802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1062832802|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1062832802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062832802} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 00:06:20,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1906712684 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1906712684 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1906712684| ~y$r_buff0_thd3~0_In-1906712684)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1906712684|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1906712684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1906712684|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1906712684} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 00:06:20,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-125479151 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-125479151 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-125479151 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-125479151 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-125479151 |P2Thread1of1ForFork2_#t~ite43_Out-125479151|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-125479151|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-125479151, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-125479151, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-125479151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-125479151} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-125479151, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-125479151, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-125479151, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-125479151|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-125479151} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 00:06:20,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In937258314 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In937258314 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out937258314 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out937258314 ~y$r_buff0_thd1~0_In937258314)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In937258314, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In937258314} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In937258314, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out937258314|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out937258314} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 00:06:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1979469369 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1979469369 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1979469369 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1979469369 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1979469369| ~y$r_buff1_thd1~0_In1979469369) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out1979469369| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1979469369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1979469369, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1979469369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1979469369} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1979469369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1979469369, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1979469369|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1979469369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1979469369} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 00:06:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 00:06:20,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 00:06:20,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-410136254 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-410136254 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-410136254|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-410136254 |P1Thread1of1ForFork1_#t~ite11_Out-410136254|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-410136254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-410136254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-410136254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-410136254, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-410136254|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 00:06:20,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1822578526 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1822578526 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1822578526 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1822578526 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1822578526|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1822578526 |P1Thread1of1ForFork1_#t~ite12_Out-1822578526|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1822578526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822578526, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1822578526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1822578526} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1822578526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822578526, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1822578526, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1822578526|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1822578526} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 00:06:20,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In832949270 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In832949270 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out832949270| ~y$r_buff0_thd2~0_In832949270)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out832949270|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In832949270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In832949270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In832949270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In832949270, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out832949270|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 00:06:20,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-474918092 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-474918092 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-474918092 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-474918092 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-474918092 |P1Thread1of1ForFork1_#t~ite14_Out-474918092|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-474918092|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-474918092, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-474918092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-474918092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-474918092} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-474918092, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-474918092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-474918092, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-474918092|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-474918092} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 00:06:20,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 00:06:20,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 00:06:20,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In259173334 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In259173334 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out259173334| ~y$w_buff1~0_In259173334) (not .cse1)) (and (= ~y~0_In259173334 |ULTIMATE.start_main_#t~ite47_Out259173334|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In259173334, ~y~0=~y~0_In259173334, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In259173334, ~y$w_buff1_used~0=~y$w_buff1_used~0_In259173334} OutVars{~y$w_buff1~0=~y$w_buff1~0_In259173334, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out259173334|, ~y~0=~y~0_In259173334, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In259173334, ~y$w_buff1_used~0=~y$w_buff1_used~0_In259173334} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 00:06:20,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-27 00:06:20,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1131985471 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1131985471 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1131985471| ~y$w_buff0_used~0_In-1131985471)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1131985471| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131985471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1131985471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131985471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1131985471, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1131985471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 00:06:20,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-460695305 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-460695305 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-460695305 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-460695305 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-460695305 |ULTIMATE.start_main_#t~ite50_Out-460695305|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-460695305|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460695305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460695305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460695305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460695305} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-460695305|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460695305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460695305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460695305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460695305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 00:06:20,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In842587771 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In842587771 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out842587771| ~y$r_buff0_thd0~0_In842587771)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out842587771|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In842587771} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out842587771|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In842587771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 00:06:20,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In796136134 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In796136134 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In796136134 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In796136134 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out796136134| ~y$r_buff1_thd0~0_In796136134) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out796136134|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In796136134, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In796136134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In796136134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In796136134} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out796136134|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In796136134, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In796136134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In796136134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In796136134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 00:06:20,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, 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, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:06:20,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:06:20 BasicIcfg [2019-12-27 00:06:20,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:06:20,758 INFO L168 Benchmark]: Toolchain (without parser) took 101299.86 ms. Allocated memory was 143.1 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 99.4 MB in the beginning and 1.0 GB in the end (delta: -940.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,759 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.13 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 153.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.31 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,763 INFO L168 Benchmark]: Boogie Preprocessor took 43.57 ms. Allocated memory is still 200.3 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,763 INFO L168 Benchmark]: RCFGBuilder took 976.15 ms. Allocated memory is still 200.3 MB. Free memory was 148.4 MB in the beginning and 98.0 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,763 INFO L168 Benchmark]: TraceAbstraction took 99407.17 ms. Allocated memory was 200.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.0 MB in the beginning and 1.0 GB in the end (delta: -942.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 00:06:20,769 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.13 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 153.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.31 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.57 ms. Allocated memory is still 200.3 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 976.15 ms. Allocated memory is still 200.3 MB. Free memory was 148.4 MB in the beginning and 98.0 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99407.17 ms. Allocated memory was 200.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.0 MB in the beginning and 1.0 GB in the end (delta: -942.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5988 SDtfs, 7951 SDslu, 20574 SDs, 0 SdLazy, 10252 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 35 SyntacticMatches, 22 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148639occurred 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: 44.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 182247 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1177 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 283195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...