/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:57:18,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:57:18,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:57:18,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:57:18,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:57:18,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:57:18,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:57:18,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:57:18,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:57:18,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:57:18,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:57:18,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:57:18,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:57:18,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:57:18,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:57:18,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:57:18,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:57:18,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:57:18,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:57:18,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:57:18,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:57:18,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:57:18,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:57:18,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:57:18,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:57:18,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:57:18,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:57:18,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:57:18,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:57:18,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:57:18,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:57:18,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:57:18,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:57:18,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:57:18,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:57:18,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:57:18,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:57:18,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:57:18,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:57:18,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:57:18,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:57:18,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:57:18,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:57:18,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:57:18,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:57:18,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:57:18,273 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:57:18,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:57:18,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:57:18,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:57:18,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:57:18,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:57:18,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:57:18,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:57:18,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:57:18,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:57:18,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:57:18,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:57:18,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:57:18,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:57:18,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:57:18,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:57:18,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:57:18,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:57:18,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:57:18,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:57:18,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:57:18,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:57:18,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:57:18,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:57:18,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:57:18,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:57:18,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:57:18,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:57:18,563 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:57:18,563 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:57:18,564 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-27 03:57:18,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658b0a355/322d0a99b04c455799ce156f9ca58100/FLAG24e006248 [2019-12-27 03:57:19,223 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:57:19,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2019-12-27 03:57:19,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658b0a355/322d0a99b04c455799ce156f9ca58100/FLAG24e006248 [2019-12-27 03:57:19,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658b0a355/322d0a99b04c455799ce156f9ca58100 [2019-12-27 03:57:19,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:57:19,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:57:19,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:57:19,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:57:19,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:57:19,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:57:19" (1/1) ... [2019-12-27 03:57:19,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:19, skipping insertion in model container [2019-12-27 03:57:19,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:57:19" (1/1) ... [2019-12-27 03:57:19,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:57:19,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:57:20,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:57:20,127 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:57:20,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:57:20,272 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:57:20,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20 WrapperNode [2019-12-27 03:57:20,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:57:20,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:57:20,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:57:20,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:57:20,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:57:20,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:57:20,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:57:20,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:57:20,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... [2019-12-27 03:57:20,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:57:20,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:57:20,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:57:20,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:57:20,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:57:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:57:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:57:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:57:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:57:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:57:20,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:57:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:57:20,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:57:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:57:20,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:57:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:57:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:57:20,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:57:20,442 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:57:21,146 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:57:21,146 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:57:21,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:57:21 BoogieIcfgContainer [2019-12-27 03:57:21,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:57:21,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:57:21,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:57:21,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:57:21,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:57:19" (1/3) ... [2019-12-27 03:57:21,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227706d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:57:21, skipping insertion in model container [2019-12-27 03:57:21,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:57:20" (2/3) ... [2019-12-27 03:57:21,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227706d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:57:21, skipping insertion in model container [2019-12-27 03:57:21,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:57:21" (3/3) ... [2019-12-27 03:57:21,161 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-27 03:57:21,172 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:57:21,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:57:21,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:57:21,186 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:57:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,311 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:57:21,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:57:21,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:57:21,356 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:57:21,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:57:21,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:57:21,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:57:21,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:57:21,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:57:21,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:57:21,374 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 03:57:21,376 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:57:21,473 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:57:21,474 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:57:21,494 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:57:21,523 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:57:21,576 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:57:21,576 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:57:21,585 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:57:21,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:57:21,609 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:57:27,300 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 03:57:27,426 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 03:57:27,447 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 03:57:27,447 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 03:57:27,451 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 03:57:39,635 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 03:57:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 03:57:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:57:39,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:57:39,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:57:39,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:57:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:57:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 03:57:39,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:57:39,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365073658] [2019-12-27 03:57:39,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:57:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:57:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:57:39,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365073658] [2019-12-27 03:57:39,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:57:39,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:57:39,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311802664] [2019-12-27 03:57:39,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:57:39,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:57:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:57:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:57:39,899 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 03:57:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:57:42,737 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 03:57:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:57:42,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:57:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:57:43,340 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 03:57:43,340 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 03:57:43,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:57:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 03:57:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 03:57:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 03:57:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 03:57:53,525 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 03:57:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:57:53,526 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 03:57:53,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:57:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 03:57:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:57:53,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:57:53,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:57:53,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:57:53,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:57:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 03:57:53,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:57:53,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731663282] [2019-12-27 03:57:53,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:57:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:57:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:57:53,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731663282] [2019-12-27 03:57:53,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:57:53,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:57:53,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596206552] [2019-12-27 03:57:53,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:57:53,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:57:53,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:57:53,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:57:53,730 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 03:57:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:57:58,290 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 03:57:58,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:57:58,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:57:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:57:58,929 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 03:57:58,929 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 03:57:58,930 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 03:58:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 03:58:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 03:58:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 03:58:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 03:58:10,394 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 03:58:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:10,395 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 03:58:10,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:58:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 03:58:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:58:10,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:10,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:10,400 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 03:58:10,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:10,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969841270] [2019-12-27 03:58:10,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:10,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969841270] [2019-12-27 03:58:10,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:10,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:58:10,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399269812] [2019-12-27 03:58:10,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:10,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:10,466 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 03:58:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:10,576 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 03:58:10,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:10,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:58:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:10,679 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 03:58:10,679 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 03:58:10,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 03:58:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 03:58:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 03:58:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 03:58:11,328 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 03:58:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:11,328 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 03:58:11,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 03:58:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:58:11,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:11,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:11,330 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 03:58:11,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:11,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405419965] [2019-12-27 03:58:11,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:11,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 03:58:11,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405419965] [2019-12-27 03:58:11,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:11,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:11,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377083254] [2019-12-27 03:58:11,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:58:11,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:58:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:11,437 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 03:58:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:11,940 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 03:58:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:58:11,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:58:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:12,028 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 03:58:12,028 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 03:58:12,029 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 03:58:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 03:58:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 03:58:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 03:58:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 03:58:13,707 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 03:58:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:13,707 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 03:58:13,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:58:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 03:58:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:58:13,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:13,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:13,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 03:58:13,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:13,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470242640] [2019-12-27 03:58:13,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:13,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470242640] [2019-12-27 03:58:13,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:13,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:58:13,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186090333] [2019-12-27 03:58:13,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:58:13,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:58:13,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:58:13,919 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 03:58:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:14,881 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 03:58:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:58:14,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:58:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:14,969 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 03:58:14,969 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 03:58:14,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:58:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 03:58:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 03:58:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 03:58:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 03:58:16,274 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 03:58:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:16,274 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 03:58:16,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:58:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 03:58:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:58:16,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:16,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:16,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 03:58:16,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:16,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103936617] [2019-12-27 03:58:16,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:16,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103936617] [2019-12-27 03:58:16,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:16,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:16,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838923822] [2019-12-27 03:58:16,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:58:16,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:58:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:58:16,351 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 03:58:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:16,422 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 03:58:16,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:58:16,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:58:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:16,443 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 03:58:16,443 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 03:58:16,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:58:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 03:58:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 03:58:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 03:58:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 03:58:16,627 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 03:58:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:16,628 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 03:58:16,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:58:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 03:58:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:58:16,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:16,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:16,645 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 03:58:16,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:16,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760225502] [2019-12-27 03:58:16,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:16,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760225502] [2019-12-27 03:58:16,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:16,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:58:16,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092478741] [2019-12-27 03:58:16,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:58:16,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:58:16,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:16,729 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 03:58:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:16,796 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 03:58:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:58:16,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 03:58:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:16,818 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 03:58:16,819 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 03:58:16,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 03:58:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 03:58:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 03:58:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 03:58:17,000 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 03:58:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:17,001 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 03:58:17,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:58:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 03:58:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:17,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:17,019 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 03:58:17,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:17,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271893261] [2019-12-27 03:58:17,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:17,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271893261] [2019-12-27 03:58:17,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:17,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:17,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830733487] [2019-12-27 03:58:17,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:58:17,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:17,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:58:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:58:17,101 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-27 03:58:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:17,183 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-27 03:58:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:58:17,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 03:58:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:17,198 INFO L225 Difference]: With dead ends: 20009 [2019-12-27 03:58:17,198 INFO L226 Difference]: Without dead ends: 9365 [2019-12-27 03:58:17,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:58:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-27 03:58:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-27 03:58:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 03:58:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 03:58:17,340 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 03:58:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:17,341 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 03:58:17,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:58:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 03:58:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:17,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:17,355 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] [2019-12-27 03:58:17,355 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 03:58:17,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:17,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977393506] [2019-12-27 03:58:17,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:17,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977393506] [2019-12-27 03:58:17,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:17,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:17,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737573059] [2019-12-27 03:58:17,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:17,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:17,462 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-27 03:58:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:18,465 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 03:58:18,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:58:18,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:18,502 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 03:58:18,502 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 03:58:18,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:58:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 03:58:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 03:58:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 03:58:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 03:58:18,763 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 03:58:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:18,763 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 03:58:18,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 03:58:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:18,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:18,779 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] [2019-12-27 03:58:18,779 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:18,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 03:58:18,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:18,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828138621] [2019-12-27 03:58:18,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:18,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828138621] [2019-12-27 03:58:18,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:18,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:18,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554917120] [2019-12-27 03:58:18,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:18,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:18,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:18,886 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-27 03:58:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:19,303 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-27 03:58:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:58:19,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:19,332 INFO L225 Difference]: With dead ends: 27840 [2019-12-27 03:58:19,332 INFO L226 Difference]: Without dead ends: 19924 [2019-12-27 03:58:19,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:58:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-27 03:58:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-27 03:58:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 03:58:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 03:58:19,584 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 03:58:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:19,584 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 03:58:19,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 03:58:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:19,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:19,603 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] [2019-12-27 03:58:19,604 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:19,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 03:58:19,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:19,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548283103] [2019-12-27 03:58:19,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:19,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548283103] [2019-12-27 03:58:19,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:19,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:19,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293738095] [2019-12-27 03:58:19,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:19,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:19,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:19,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:19,699 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-27 03:58:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:20,075 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-27 03:58:20,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:58:20,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:20,111 INFO L225 Difference]: With dead ends: 25803 [2019-12-27 03:58:20,111 INFO L226 Difference]: Without dead ends: 23832 [2019-12-27 03:58:20,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:58:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-27 03:58:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-27 03:58:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-27 03:58:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-27 03:58:20,388 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-27 03:58:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:20,388 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-27 03:58:20,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-27 03:58:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:20,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:20,404 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] [2019-12-27 03:58:20,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 03:58:20,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:20,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946445677] [2019-12-27 03:58:20,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:20,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946445677] [2019-12-27 03:58:20,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:20,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:58:20,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387616282] [2019-12-27 03:58:20,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:20,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:20,461 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-27 03:58:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:20,570 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-27 03:58:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:20,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:58:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:20,611 INFO L225 Difference]: With dead ends: 18737 [2019-12-27 03:58:20,611 INFO L226 Difference]: Without dead ends: 18737 [2019-12-27 03:58:20,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-27 03:58:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-27 03:58:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-27 03:58:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-27 03:58:21,421 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-27 03:58:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:21,421 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-27 03:58:21,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-27 03:58:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:21,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:21,441 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] [2019-12-27 03:58:21,441 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 03:58:21,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:21,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19610823] [2019-12-27 03:58:21,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:21,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19610823] [2019-12-27 03:58:21,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:21,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:58:21,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844520160] [2019-12-27 03:58:21,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:58:21,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:58:21,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:58:21,558 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-27 03:58:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:22,312 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-27 03:58:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:58:22,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 03:58:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:22,361 INFO L225 Difference]: With dead ends: 31543 [2019-12-27 03:58:22,362 INFO L226 Difference]: Without dead ends: 31459 [2019-12-27 03:58:22,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-27 03:58:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-27 03:58:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-27 03:58:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-27 03:58:22,749 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-27 03:58:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:22,750 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-27 03:58:22,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:58:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-27 03:58:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:22,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:22,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:22,783 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 03:58:22,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:22,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95496835] [2019-12-27 03:58:22,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:22,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95496835] [2019-12-27 03:58:22,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:22,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:58:22,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344537590] [2019-12-27 03:58:22,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:22,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:22,927 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-27 03:58:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:23,986 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-27 03:58:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:58:23,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 03:58:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:24,033 INFO L225 Difference]: With dead ends: 31464 [2019-12-27 03:58:24,033 INFO L226 Difference]: Without dead ends: 31342 [2019-12-27 03:58:24,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:58:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-27 03:58:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-27 03:58:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-27 03:58:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-27 03:58:25,009 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-27 03:58:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:25,009 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-27 03:58:25,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-27 03:58:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:25,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:25,053 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] [2019-12-27 03:58:25,053 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 03:58:25,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:25,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616290463] [2019-12-27 03:58:25,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:25,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616290463] [2019-12-27 03:58:25,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:25,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:25,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855389576] [2019-12-27 03:58:25,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:58:25,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:25,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:58:25,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:25,205 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-27 03:58:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:26,990 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-27 03:58:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:58:26,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 03:58:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:27,055 INFO L225 Difference]: With dead ends: 41056 [2019-12-27 03:58:27,055 INFO L226 Difference]: Without dead ends: 41056 [2019-12-27 03:58:27,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:58:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-27 03:58:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-27 03:58:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-27 03:58:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-27 03:58:27,536 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-27 03:58:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:27,537 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-27 03:58:27,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:58:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-27 03:58:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:58:27,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:27,563 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] [2019-12-27 03:58:27,563 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 03:58:27,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:27,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199763656] [2019-12-27 03:58:27,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:27,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199763656] [2019-12-27 03:58:27,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:27,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:58:27,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280435547] [2019-12-27 03:58:27,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:27,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:27,628 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-27 03:58:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:27,710 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-27 03:58:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:27,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:58:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:27,744 INFO L225 Difference]: With dead ends: 17418 [2019-12-27 03:58:27,744 INFO L226 Difference]: Without dead ends: 17418 [2019-12-27 03:58:27,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-27 03:58:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-27 03:58:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-27 03:58:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-27 03:58:28,705 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-27 03:58:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:28,706 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-27 03:58:28,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-27 03:58:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:28,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:28,732 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] [2019-12-27 03:58:28,733 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 03:58:28,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:28,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318552089] [2019-12-27 03:58:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:28,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318552089] [2019-12-27 03:58:28,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:28,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:58:28,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775951143] [2019-12-27 03:58:28,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:58:28,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:58:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:58:28,878 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 7 states. [2019-12-27 03:58:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:29,750 INFO L93 Difference]: Finished difference Result 23352 states and 69676 transitions. [2019-12-27 03:58:29,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:58:29,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 03:58:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:29,783 INFO L225 Difference]: With dead ends: 23352 [2019-12-27 03:58:29,783 INFO L226 Difference]: Without dead ends: 23216 [2019-12-27 03:58:29,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:58:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-27 03:58:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18293. [2019-12-27 03:58:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18293 states. [2019-12-27 03:58:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18293 states to 18293 states and 55408 transitions. [2019-12-27 03:58:30,083 INFO L78 Accepts]: Start accepts. Automaton has 18293 states and 55408 transitions. Word has length 54 [2019-12-27 03:58:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:30,083 INFO L462 AbstractCegarLoop]: Abstraction has 18293 states and 55408 transitions. [2019-12-27 03:58:30,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:58:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 18293 states and 55408 transitions. [2019-12-27 03:58:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:30,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:30,104 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] [2019-12-27 03:58:30,104 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-27 03:58:30,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:30,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883073832] [2019-12-27 03:58:30,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:30,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883073832] [2019-12-27 03:58:30,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:30,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:30,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708637984] [2019-12-27 03:58:30,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:58:30,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:58:30,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:30,232 INFO L87 Difference]: Start difference. First operand 18293 states and 55408 transitions. Second operand 9 states. [2019-12-27 03:58:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:32,212 INFO L93 Difference]: Finished difference Result 23511 states and 69927 transitions. [2019-12-27 03:58:32,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 03:58:32,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 03:58:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:32,244 INFO L225 Difference]: With dead ends: 23511 [2019-12-27 03:58:32,244 INFO L226 Difference]: Without dead ends: 23511 [2019-12-27 03:58:32,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 03:58:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23511 states. [2019-12-27 03:58:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23511 to 16096. [2019-12-27 03:58:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-27 03:58:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 49156 transitions. [2019-12-27 03:58:32,537 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 49156 transitions. Word has length 54 [2019-12-27 03:58:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:32,537 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 49156 transitions. [2019-12-27 03:58:32,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:58:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 49156 transitions. [2019-12-27 03:58:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:32,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:32,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:32,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 3 times [2019-12-27 03:58:32,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:32,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891600392] [2019-12-27 03:58:32,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:33,152 WARN L192 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 03:58:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:33,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891600392] [2019-12-27 03:58:33,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:33,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:58:33,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162346242] [2019-12-27 03:58:33,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:58:33,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:58:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:58:33,210 INFO L87 Difference]: Start difference. First operand 16096 states and 49156 transitions. Second operand 9 states. [2019-12-27 03:58:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:34,529 INFO L93 Difference]: Finished difference Result 30201 states and 91855 transitions. [2019-12-27 03:58:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:58:34,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 03:58:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:34,575 INFO L225 Difference]: With dead ends: 30201 [2019-12-27 03:58:34,575 INFO L226 Difference]: Without dead ends: 23426 [2019-12-27 03:58:34,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:58:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23426 states. [2019-12-27 03:58:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23426 to 16553. [2019-12-27 03:58:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16553 states. [2019-12-27 03:58:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16553 states to 16553 states and 50075 transitions. [2019-12-27 03:58:34,877 INFO L78 Accepts]: Start accepts. Automaton has 16553 states and 50075 transitions. Word has length 54 [2019-12-27 03:58:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:34,878 INFO L462 AbstractCegarLoop]: Abstraction has 16553 states and 50075 transitions. [2019-12-27 03:58:34,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:58:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16553 states and 50075 transitions. [2019-12-27 03:58:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:34,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:34,896 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] [2019-12-27 03:58:34,896 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 4 times [2019-12-27 03:58:34,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:34,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239681776] [2019-12-27 03:58:34,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:35,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239681776] [2019-12-27 03:58:35,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:35,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:35,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288842340] [2019-12-27 03:58:35,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:58:35,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:58:35,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:58:35,054 INFO L87 Difference]: Start difference. First operand 16553 states and 50075 transitions. Second operand 11 states. [2019-12-27 03:58:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:36,186 INFO L93 Difference]: Finished difference Result 32000 states and 96391 transitions. [2019-12-27 03:58:36,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 03:58:36,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 03:58:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:36,234 INFO L225 Difference]: With dead ends: 32000 [2019-12-27 03:58:36,234 INFO L226 Difference]: Without dead ends: 30902 [2019-12-27 03:58:36,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:58:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30902 states. [2019-12-27 03:58:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30902 to 18971. [2019-12-27 03:58:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18971 states. [2019-12-27 03:58:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18971 states to 18971 states and 57155 transitions. [2019-12-27 03:58:36,604 INFO L78 Accepts]: Start accepts. Automaton has 18971 states and 57155 transitions. Word has length 54 [2019-12-27 03:58:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:36,604 INFO L462 AbstractCegarLoop]: Abstraction has 18971 states and 57155 transitions. [2019-12-27 03:58:36,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:58:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18971 states and 57155 transitions. [2019-12-27 03:58:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:36,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:36,626 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] [2019-12-27 03:58:36,626 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash 845727880, now seen corresponding path program 5 times [2019-12-27 03:58:36,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:36,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966915293] [2019-12-27 03:58:36,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:36,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966915293] [2019-12-27 03:58:36,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:58:36,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506594348] [2019-12-27 03:58:36,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:58:36,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:58:36,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:58:36,781 INFO L87 Difference]: Start difference. First operand 18971 states and 57155 transitions. Second operand 11 states. [2019-12-27 03:58:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:37,675 INFO L93 Difference]: Finished difference Result 31387 states and 94014 transitions. [2019-12-27 03:58:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:58:37,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 03:58:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:38,207 INFO L225 Difference]: With dead ends: 31387 [2019-12-27 03:58:38,208 INFO L226 Difference]: Without dead ends: 25808 [2019-12-27 03:58:38,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:58:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25808 states. [2019-12-27 03:58:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25808 to 15801. [2019-12-27 03:58:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15801 states. [2019-12-27 03:58:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15801 states to 15801 states and 47745 transitions. [2019-12-27 03:58:38,506 INFO L78 Accepts]: Start accepts. Automaton has 15801 states and 47745 transitions. Word has length 54 [2019-12-27 03:58:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:38,506 INFO L462 AbstractCegarLoop]: Abstraction has 15801 states and 47745 transitions. [2019-12-27 03:58:38,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:58:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 15801 states and 47745 transitions. [2019-12-27 03:58:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:58:38,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:38,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:58:38,523 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:38,523 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 6 times [2019-12-27 03:58:38,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:38,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236169255] [2019-12-27 03:58:38,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:38,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236169255] [2019-12-27 03:58:38,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:38,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:58:38,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065513391] [2019-12-27 03:58:38,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:58:38,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:58:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:38,572 INFO L87 Difference]: Start difference. First operand 15801 states and 47745 transitions. Second operand 3 states. [2019-12-27 03:58:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:38,641 INFO L93 Difference]: Finished difference Result 15799 states and 47740 transitions. [2019-12-27 03:58:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:58:38,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 03:58:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:38,671 INFO L225 Difference]: With dead ends: 15799 [2019-12-27 03:58:38,671 INFO L226 Difference]: Without dead ends: 15799 [2019-12-27 03:58:38,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:58:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15799 states. [2019-12-27 03:58:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15799 to 14369. [2019-12-27 03:58:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14369 states. [2019-12-27 03:58:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14369 states to 14369 states and 43776 transitions. [2019-12-27 03:58:39,055 INFO L78 Accepts]: Start accepts. Automaton has 14369 states and 43776 transitions. Word has length 54 [2019-12-27 03:58:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:39,056 INFO L462 AbstractCegarLoop]: Abstraction has 14369 states and 43776 transitions. [2019-12-27 03:58:39,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:58:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 14369 states and 43776 transitions. [2019-12-27 03:58:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:58:39,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:39,078 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] [2019-12-27 03:58:39,078 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 1 times [2019-12-27 03:58:39,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:39,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844275329] [2019-12-27 03:58:39,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:58:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:58:39,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844275329] [2019-12-27 03:58:39,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:58:39,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:58:39,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943389395] [2019-12-27 03:58:39,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:58:39,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:58:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:58:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:58:39,514 INFO L87 Difference]: Start difference. First operand 14369 states and 43776 transitions. Second operand 15 states. [2019-12-27 03:58:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:58:42,653 INFO L93 Difference]: Finished difference Result 24874 states and 74945 transitions. [2019-12-27 03:58:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 03:58:42,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 03:58:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:58:42,689 INFO L225 Difference]: With dead ends: 24874 [2019-12-27 03:58:42,689 INFO L226 Difference]: Without dead ends: 24526 [2019-12-27 03:58:42,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=420, Invalid=2130, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 03:58:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24526 states. [2019-12-27 03:58:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24526 to 14223. [2019-12-27 03:58:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14223 states. [2019-12-27 03:58:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14223 states to 14223 states and 43434 transitions. [2019-12-27 03:58:43,503 INFO L78 Accepts]: Start accepts. Automaton has 14223 states and 43434 transitions. Word has length 55 [2019-12-27 03:58:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:58:43,504 INFO L462 AbstractCegarLoop]: Abstraction has 14223 states and 43434 transitions. [2019-12-27 03:58:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:58:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14223 states and 43434 transitions. [2019-12-27 03:58:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:58:43,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:58:43,518 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] [2019-12-27 03:58:43,519 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:58:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:58:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 2 times [2019-12-27 03:58:43,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:58:43,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848105347] [2019-12-27 03:58:43,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:58:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:58:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:58:43,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:58:43,644 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:58:43,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:58:43,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 03:58:43,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-27 03:58:43,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0_~arg.offset_Out39671440 |P1Thread1of1ForFork0_#in~arg.offset_In39671440|) (= P1Thread1of1ForFork0_~arg.base_Out39671440 |P1Thread1of1ForFork0_#in~arg.base_In39671440|) (= 1 ~x$w_buff0~0_Out39671440) (= ~x$w_buff1~0_Out39671440 ~x$w_buff0~0_In39671440) (= 1 ~x$w_buff0_used~0_Out39671440) (= 0 (mod ~x$w_buff1_used~0_Out39671440 256)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out39671440| 1) (= ~x$w_buff1_used~0_Out39671440 ~x$w_buff0_used~0_In39671440) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out39671440| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out39671440)) InVars {~x$w_buff0~0=~x$w_buff0~0_In39671440, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In39671440|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In39671440|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39671440} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out39671440, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out39671440, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out39671440, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out39671440, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out39671440|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In39671440|, ~x$w_buff1~0=~x$w_buff1~0_Out39671440, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In39671440|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out39671440, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out39671440} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:58:43,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In2133683728 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2133683728 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out2133683728| ~x~0_In2133683728)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out2133683728| ~x$w_buff1~0_In2133683728)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2133683728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133683728, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2133683728, ~x~0=~x~0_In2133683728} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out2133683728|, ~x$w_buff1~0=~x$w_buff1~0_In2133683728, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2133683728, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2133683728, ~x~0=~x~0_In2133683728} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:58:43,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:58:43,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-250150327 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-250150327 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-250150327|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-250150327 |P2Thread1of1ForFork1_#t~ite34_Out-250150327|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-250150327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-250150327} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-250150327|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-250150327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-250150327} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:58:43,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1208214868 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1208214868 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1208214868 |P1Thread1of1ForFork0_#t~ite28_Out1208214868|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1208214868|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1208214868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1208214868} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1208214868, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1208214868|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1208214868} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 03:58:43,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-990791858 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-990791858 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-990791858 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-990791858 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-990791858| ~x$w_buff1_used~0_In-990791858) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-990791858| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-990791858, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-990791858, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-990791858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-990791858} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-990791858, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-990791858, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-990791858, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-990791858|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-990791858} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 03:58:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1084242039 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1084242039 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-1084242039 ~x$r_buff0_thd2~0_Out-1084242039) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-1084242039) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1084242039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1084242039} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1084242039|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1084242039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1084242039} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:58:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1848162962 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1848162962 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1848162962 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1848162962 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1848162962| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1848162962| ~x$r_buff1_thd2~0_In1848162962) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1848162962, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1848162962, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1848162962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1848162962} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1848162962|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1848162962, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1848162962, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1848162962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1848162962} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 03:58:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 03:58:43,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1200254744 256)))) (or (and (= ~x$w_buff1~0_In-1200254744 |P0Thread1of1ForFork2_#t~ite11_Out-1200254744|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1200254744| |P0Thread1of1ForFork2_#t~ite11_Out-1200254744|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1200254744 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1200254744 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1200254744 256))) (= 0 (mod ~x$w_buff0_used~0_In-1200254744 256))))) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1200254744| |P0Thread1of1ForFork2_#t~ite11_Out-1200254744|) (= ~x$w_buff1~0_In-1200254744 |P0Thread1of1ForFork2_#t~ite12_Out-1200254744|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1200254744, ~x$w_buff1~0=~x$w_buff1~0_In-1200254744, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200254744, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1200254744, ~weak$$choice2~0=~weak$$choice2~0_In-1200254744, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1200254744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200254744} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1200254744, ~x$w_buff1~0=~x$w_buff1~0_In-1200254744, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200254744, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1200254744, ~weak$$choice2~0=~weak$$choice2~0_In-1200254744, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1200254744|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1200254744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200254744} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 03:58:43,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In400790939 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out400790939| |P0Thread1of1ForFork2_#t~ite14_Out400790939|) (= |P0Thread1of1ForFork2_#t~ite14_Out400790939| ~x$w_buff0_used~0_In400790939) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In400790939 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In400790939 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In400790939 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In400790939 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out400790939| ~x$w_buff0_used~0_In400790939) (= |P0Thread1of1ForFork2_#t~ite14_In400790939| |P0Thread1of1ForFork2_#t~ite14_Out400790939|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In400790939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In400790939, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In400790939, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In400790939|, ~weak$$choice2~0=~weak$$choice2~0_In400790939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In400790939} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In400790939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In400790939, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out400790939|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In400790939, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out400790939|, ~weak$$choice2~0=~weak$$choice2~0_In400790939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In400790939} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 03:58:43,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-994951800 256)))) (or (and (= ~x$w_buff1_used~0_In-994951800 |P0Thread1of1ForFork2_#t~ite17_Out-994951800|) (= |P0Thread1of1ForFork2_#t~ite17_Out-994951800| |P0Thread1of1ForFork2_#t~ite18_Out-994951800|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-994951800 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-994951800 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-994951800 256))) (= (mod ~x$w_buff0_used~0_In-994951800 256) 0)))) (and (= ~x$w_buff1_used~0_In-994951800 |P0Thread1of1ForFork2_#t~ite18_Out-994951800|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-994951800| |P0Thread1of1ForFork2_#t~ite17_Out-994951800|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-994951800, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-994951800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-994951800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-994951800, ~weak$$choice2~0=~weak$$choice2~0_In-994951800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-994951800} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-994951800, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-994951800|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-994951800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-994951800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-994951800, ~weak$$choice2~0=~weak$$choice2~0_In-994951800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-994951800} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:58:43,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:58:43,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 03:58:43,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1143092973 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1143092973 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1143092973 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1143092973 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1143092973|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1143092973 |P2Thread1of1ForFork1_#t~ite35_Out1143092973|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1143092973, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1143092973, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1143092973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1143092973} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1143092973|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1143092973, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1143092973, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1143092973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1143092973} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:58:43,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-217114855 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-217114855 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-217114855| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-217114855| ~x$r_buff0_thd3~0_In-217114855)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-217114855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-217114855} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-217114855|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-217114855, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-217114855} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:58:43,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1299464990 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1299464990 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1299464990 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1299464990 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1299464990| ~x$r_buff1_thd3~0_In-1299464990) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1299464990| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1299464990, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1299464990, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1299464990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1299464990} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1299464990|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1299464990, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1299464990, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1299464990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1299464990} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:58:43,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 03:58:43,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:58:43,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In89785903 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In89785903 256)))) (or (and (= ~x$w_buff1~0_In89785903 |ULTIMATE.start_main_#t~ite41_Out89785903|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out89785903| ~x~0_In89785903)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In89785903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In89785903, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In89785903, ~x~0=~x~0_In89785903} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out89785903|, ~x$w_buff1~0=~x$w_buff1~0_In89785903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In89785903, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In89785903, ~x~0=~x~0_In89785903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 03:58:43,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 03:58:43,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In194167313 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In194167313 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out194167313| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out194167313| ~x$w_buff0_used~0_In194167313) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In194167313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In194167313} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In194167313, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out194167313|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In194167313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:58:43,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1516305099 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1516305099 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1516305099 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1516305099 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1516305099| 0)) (and (= ~x$w_buff1_used~0_In1516305099 |ULTIMATE.start_main_#t~ite44_Out1516305099|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1516305099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1516305099, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1516305099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1516305099} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1516305099, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1516305099, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1516305099, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1516305099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1516305099} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:58:43,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1648476091 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1648476091 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1648476091|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1648476091 |ULTIMATE.start_main_#t~ite45_Out-1648476091|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1648476091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1648476091} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1648476091, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1648476091|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1648476091} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:58:43,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-707920031 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-707920031 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-707920031 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-707920031 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-707920031|)) (and (= ~x$r_buff1_thd0~0_In-707920031 |ULTIMATE.start_main_#t~ite46_Out-707920031|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-707920031, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-707920031, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-707920031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-707920031} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-707920031, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-707920031|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-707920031, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-707920031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-707920031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 03:58:43,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:58:43,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:58:43 BasicIcfg [2019-12-27 03:58:43,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:58:43,787 INFO L168 Benchmark]: Toolchain (without parser) took 84322.21 ms. Allocated memory was 137.4 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 99.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,788 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.93 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.8 MB in the beginning and 155.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.16 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,789 INFO L168 Benchmark]: Boogie Preprocessor took 44.91 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,789 INFO L168 Benchmark]: RCFGBuilder took 767.79 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 103.9 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,790 INFO L168 Benchmark]: TraceAbstraction took 82635.10 ms. Allocated memory was 201.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 03:58:43,793 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.93 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 98.8 MB in the beginning and 155.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.16 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.91 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.79 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 103.9 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82635.10 ms. Allocated memory was 201.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 82.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4966 SDtfs, 6125 SDslu, 16904 SDs, 0 SdLazy, 10579 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 63 SyntacticMatches, 20 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 32.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 151906 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 182969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...