/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/mix016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:34:24,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:34:24,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:34:24,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:34:24,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:34:24,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:34:24,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:34:24,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:34:24,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:34:24,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:34:24,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:34:24,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:34:24,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:34:24,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:34:24,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:34:24,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:34:24,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:34:24,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:34:24,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:34:24,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:34:24,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:34:24,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:34:24,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:34:24,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:34:24,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:34:24,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:34:24,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:34:24,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:34:24,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:34:24,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:34:24,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:34:24,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:34:24,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:34:24,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:34:24,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:34:24,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:34:24,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:34:24,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:34:24,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:34:24,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:34:24,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:34:24,297 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 01:34:24,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:34:24,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:34:24,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:34:24,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:34:24,318 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:34:24,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:34:24,319 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:34:24,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:34:24,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:34:24,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:34:24,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:34:24,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:34:24,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:34:24,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:34:24,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:34:24,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:34:24,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:34:24,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:34:24,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:34:24,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:34:24,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:34:24,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:34:24,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:34:24,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:34:24,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:34:24,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:34:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:34:24,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:34:24,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:34:24,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:34:24,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:34:24,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:34:24,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:34:24,624 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:34:24,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-27 01:34:24,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18e9bc17/81f5da65fe3542d9a95a2722a73451bc/FLAG866e40053 [2019-12-27 01:34:25,297 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:34:25,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt.i [2019-12-27 01:34:25,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18e9bc17/81f5da65fe3542d9a95a2722a73451bc/FLAG866e40053 [2019-12-27 01:34:25,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18e9bc17/81f5da65fe3542d9a95a2722a73451bc [2019-12-27 01:34:25,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:34:25,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:34:25,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:34:25,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:34:25,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:34:25,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:34:25" (1/1) ... [2019-12-27 01:34:25,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:25, skipping insertion in model container [2019-12-27 01:34:25,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:34:25" (1/1) ... [2019-12-27 01:34:25,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:34:25,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:34:26,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:34:26,151 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:34:26,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:34:26,326 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:34:26,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26 WrapperNode [2019-12-27 01:34:26,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:34:26,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:34:26,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:34:26,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:34:26,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:34:26,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:34:26,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:34:26,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:34:26,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (1/1) ... [2019-12-27 01:34:26,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:34:26,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:34:26,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:34:26,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:34:26,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (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 01:34:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:34:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:34:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:34:26,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:34:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:34:26,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:34:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:34:26,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:34:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:34:26,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:34:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:34:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:34:26,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:34:26,589 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 01:34:27,395 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:34:27,395 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:34:27,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:34:27 BoogieIcfgContainer [2019-12-27 01:34:27,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:34:27,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:34:27,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:34:27,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:34:27,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:34:25" (1/3) ... [2019-12-27 01:34:27,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77246d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:34:27, skipping insertion in model container [2019-12-27 01:34:27,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:34:26" (2/3) ... [2019-12-27 01:34:27,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77246d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:34:27, skipping insertion in model container [2019-12-27 01:34:27,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:34:27" (3/3) ... [2019-12-27 01:34:27,406 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.opt.i [2019-12-27 01:34:27,416 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:34:27,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:34:27,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:34:27,424 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:34:27,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,467 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,542 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:34:27,562 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:34:27,581 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:34:27,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:34:27,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:34:27,582 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:34:27,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:34:27,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:34:27,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:34:27,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:34:27,598 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 01:34:27,600 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 01:34:27,696 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 01:34:27,696 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:34:27,711 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 01:34:27,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 01:34:27,784 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 01:34:27,784 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:34:27,792 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 01:34:27,811 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 01:34:27,812 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:34:32,974 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-27 01:34:33,135 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 01:34:33,598 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 01:34:33,717 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 01:34:33,750 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75392 [2019-12-27 01:34:33,750 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 01:34:33,754 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-27 01:34:44,675 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86190 states. [2019-12-27 01:34:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 86190 states. [2019-12-27 01:34:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 01:34:44,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:44,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 01:34:44,685 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 01:34:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash 802149997, now seen corresponding path program 1 times [2019-12-27 01:34:44,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:44,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125810543] [2019-12-27 01:34:44,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:44,938 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 01:34:44,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125810543] [2019-12-27 01:34:44,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:44,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:34:44,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712250726] [2019-12-27 01:34:44,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:44,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:44,964 INFO L87 Difference]: Start difference. First operand 86190 states. Second operand 3 states. [2019-12-27 01:34:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:47,228 INFO L93 Difference]: Finished difference Result 85100 states and 365324 transitions. [2019-12-27 01:34:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 01:34:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:47,709 INFO L225 Difference]: With dead ends: 85100 [2019-12-27 01:34:47,710 INFO L226 Difference]: Without dead ends: 79822 [2019-12-27 01:34:47,711 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 01:34:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79822 states. [2019-12-27 01:34:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79822 to 79822. [2019-12-27 01:34:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79822 states. [2019-12-27 01:34:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79822 states to 79822 states and 342168 transitions. [2019-12-27 01:34:58,175 INFO L78 Accepts]: Start accepts. Automaton has 79822 states and 342168 transitions. Word has length 5 [2019-12-27 01:34:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:58,175 INFO L462 AbstractCegarLoop]: Abstraction has 79822 states and 342168 transitions. [2019-12-27 01:34:58,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 79822 states and 342168 transitions. [2019-12-27 01:34:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:34:58,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:58,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:58,184 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 01:34:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1460490103, now seen corresponding path program 1 times [2019-12-27 01:34:58,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:58,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114929321] [2019-12-27 01:34:58,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:58,288 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 01:34:58,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114929321] [2019-12-27 01:34:58,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:58,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:58,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782260416] [2019-12-27 01:34:58,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:58,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:58,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:58,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:58,292 INFO L87 Difference]: Start difference. First operand 79822 states and 342168 transitions. Second operand 3 states. [2019-12-27 01:34:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:58,620 INFO L93 Difference]: Finished difference Result 21012 states and 72403 transitions. [2019-12-27 01:34:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:58,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:34:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:58,698 INFO L225 Difference]: With dead ends: 21012 [2019-12-27 01:34:58,698 INFO L226 Difference]: Without dead ends: 21012 [2019-12-27 01:34:58,699 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 01:34:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21012 states. [2019-12-27 01:34:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21012 to 21012. [2019-12-27 01:34:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-27 01:34:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 72403 transitions. [2019-12-27 01:34:59,183 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 72403 transitions. Word has length 13 [2019-12-27 01:34:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:59,183 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 72403 transitions. [2019-12-27 01:34:59,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 72403 transitions. [2019-12-27 01:34:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:34:59,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:59,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:59,186 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 01:34:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1843446667, now seen corresponding path program 1 times [2019-12-27 01:34:59,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:59,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236006553] [2019-12-27 01:34:59,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:59,270 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 01:34:59,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236006553] [2019-12-27 01:34:59,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:59,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052423558] [2019-12-27 01:34:59,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:59,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:59,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:59,273 INFO L87 Difference]: Start difference. First operand 21012 states and 72403 transitions. Second operand 4 states. [2019-12-27 01:34:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:59,630 INFO L93 Difference]: Finished difference Result 31168 states and 104167 transitions. [2019-12-27 01:34:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:34:59,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 01:34:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:59,750 INFO L225 Difference]: With dead ends: 31168 [2019-12-27 01:34:59,750 INFO L226 Difference]: Without dead ends: 31154 [2019-12-27 01:34:59,750 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 01:35:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31154 states. [2019-12-27 01:35:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31154 to 27751. [2019-12-27 01:35:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-27 01:35:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 93636 transitions. [2019-12-27 01:35:01,079 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 93636 transitions. Word has length 13 [2019-12-27 01:35:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:01,079 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 93636 transitions. [2019-12-27 01:35:01,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 93636 transitions. [2019-12-27 01:35:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:35:01,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:01,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:01,082 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 01:35:01,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:01,083 INFO L82 PathProgramCache]: Analyzing trace with hash 890356816, now seen corresponding path program 1 times [2019-12-27 01:35:01,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:01,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457552559] [2019-12-27 01:35:01,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:01,191 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 01:35:01,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457552559] [2019-12-27 01:35:01,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:01,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:01,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915502157] [2019-12-27 01:35:01,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:35:01,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:01,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:35:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:01,196 INFO L87 Difference]: Start difference. First operand 27751 states and 93636 transitions. Second operand 5 states. [2019-12-27 01:35:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:01,684 INFO L93 Difference]: Finished difference Result 40618 states and 134851 transitions. [2019-12-27 01:35:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:35:01,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 01:35:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:01,801 INFO L225 Difference]: With dead ends: 40618 [2019-12-27 01:35:01,801 INFO L226 Difference]: Without dead ends: 40602 [2019-12-27 01:35:01,802 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 01:35:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40602 states. [2019-12-27 01:35:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40602 to 32075. [2019-12-27 01:35:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32075 states. [2019-12-27 01:35:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 107493 transitions. [2019-12-27 01:35:03,152 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 107493 transitions. Word has length 14 [2019-12-27 01:35:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:03,153 INFO L462 AbstractCegarLoop]: Abstraction has 32075 states and 107493 transitions. [2019-12-27 01:35:03,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:35:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 107493 transitions. [2019-12-27 01:35:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:35:03,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:03,165 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 01:35:03,166 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 01:35:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 454702152, now seen corresponding path program 1 times [2019-12-27 01:35:03,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:03,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037702654] [2019-12-27 01:35:03,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:03,257 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 01:35:03,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037702654] [2019-12-27 01:35:03,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:03,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:35:03,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154121909] [2019-12-27 01:35:03,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:35:03,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:03,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:35:03,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:35:03,260 INFO L87 Difference]: Start difference. First operand 32075 states and 107493 transitions. Second operand 6 states. [2019-12-27 01:35:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:04,197 INFO L93 Difference]: Finished difference Result 48617 states and 159685 transitions. [2019-12-27 01:35:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:35:04,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 01:35:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:04,333 INFO L225 Difference]: With dead ends: 48617 [2019-12-27 01:35:04,333 INFO L226 Difference]: Without dead ends: 48589 [2019-12-27 01:35:04,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:35:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48589 states. [2019-12-27 01:35:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48589 to 33099. [2019-12-27 01:35:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-12-27 01:35:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 109984 transitions. [2019-12-27 01:35:05,692 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 109984 transitions. Word has length 22 [2019-12-27 01:35:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:05,692 INFO L462 AbstractCegarLoop]: Abstraction has 33099 states and 109984 transitions. [2019-12-27 01:35:05,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:35:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 109984 transitions. [2019-12-27 01:35:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:35:05,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:05,710 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 01:35:05,710 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 01:35:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1218687100, now seen corresponding path program 1 times [2019-12-27 01:35:05,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:05,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912656372] [2019-12-27 01:35:05,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:05,765 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 01:35:05,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912656372] [2019-12-27 01:35:05,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:05,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:05,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756701955] [2019-12-27 01:35:05,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:05,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:05,768 INFO L87 Difference]: Start difference. First operand 33099 states and 109984 transitions. Second operand 4 states. [2019-12-27 01:35:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:05,834 INFO L93 Difference]: Finished difference Result 13493 states and 41620 transitions. [2019-12-27 01:35:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:35:05,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:35:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:05,852 INFO L225 Difference]: With dead ends: 13493 [2019-12-27 01:35:05,853 INFO L226 Difference]: Without dead ends: 13493 [2019-12-27 01:35:05,853 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 01:35:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2019-12-27 01:35:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13273. [2019-12-27 01:35:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13273 states. [2019-12-27 01:35:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13273 states to 13273 states and 40970 transitions. [2019-12-27 01:35:06,069 INFO L78 Accepts]: Start accepts. Automaton has 13273 states and 40970 transitions. Word has length 25 [2019-12-27 01:35:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:06,069 INFO L462 AbstractCegarLoop]: Abstraction has 13273 states and 40970 transitions. [2019-12-27 01:35:06,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 13273 states and 40970 transitions. [2019-12-27 01:35:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:35:06,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:06,088 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 01:35:06,088 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 01:35:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1155983199, now seen corresponding path program 1 times [2019-12-27 01:35:06,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:06,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445984440] [2019-12-27 01:35:06,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:06,173 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 01:35:06,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445984440] [2019-12-27 01:35:06,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:06,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:35:06,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200816279] [2019-12-27 01:35:06,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:35:06,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:06,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:35:06,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:35:06,175 INFO L87 Difference]: Start difference. First operand 13273 states and 40970 transitions. Second operand 5 states. [2019-12-27 01:35:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:06,246 INFO L93 Difference]: Finished difference Result 12040 states and 37785 transitions. [2019-12-27 01:35:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:35:06,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 01:35:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:06,268 INFO L225 Difference]: With dead ends: 12040 [2019-12-27 01:35:06,268 INFO L226 Difference]: Without dead ends: 11998 [2019-12-27 01:35:06,268 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 01:35:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-12-27 01:35:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 11419. [2019-12-27 01:35:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11419 states. [2019-12-27 01:35:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 36001 transitions. [2019-12-27 01:35:06,691 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 36001 transitions. Word has length 39 [2019-12-27 01:35:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:06,691 INFO L462 AbstractCegarLoop]: Abstraction has 11419 states and 36001 transitions. [2019-12-27 01:35:06,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:35:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 36001 transitions. [2019-12-27 01:35:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:06,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:06,709 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 01:35:06,709 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 01:35:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:06,709 INFO L82 PathProgramCache]: Analyzing trace with hash 588132615, now seen corresponding path program 1 times [2019-12-27 01:35:06,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:06,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262790202] [2019-12-27 01:35:06,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:06,795 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 01:35:06,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262790202] [2019-12-27 01:35:06,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:06,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:06,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123098069] [2019-12-27 01:35:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:35:06,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:35:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:35:06,797 INFO L87 Difference]: Start difference. First operand 11419 states and 36001 transitions. Second operand 4 states. [2019-12-27 01:35:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:06,886 INFO L93 Difference]: Finished difference Result 20766 states and 65459 transitions. [2019-12-27 01:35:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:35:06,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 01:35:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:06,906 INFO L225 Difference]: With dead ends: 20766 [2019-12-27 01:35:06,907 INFO L226 Difference]: Without dead ends: 9680 [2019-12-27 01:35:06,907 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 01:35:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2019-12-27 01:35:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9680. [2019-12-27 01:35:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9680 states. [2019-12-27 01:35:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 30383 transitions. [2019-12-27 01:35:07,179 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 30383 transitions. Word has length 53 [2019-12-27 01:35:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:07,179 INFO L462 AbstractCegarLoop]: Abstraction has 9680 states and 30383 transitions. [2019-12-27 01:35:07,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:35:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 30383 transitions. [2019-12-27 01:35:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:07,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:07,200 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 01:35:07,200 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 01:35:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:07,200 INFO L82 PathProgramCache]: Analyzing trace with hash 104371591, now seen corresponding path program 2 times [2019-12-27 01:35:07,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:07,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101157864] [2019-12-27 01:35:07,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:07,327 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 01:35:07,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101157864] [2019-12-27 01:35:07,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:07,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:07,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211219425] [2019-12-27 01:35:07,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:07,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:07,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:07,331 INFO L87 Difference]: Start difference. First operand 9680 states and 30383 transitions. Second operand 7 states. [2019-12-27 01:35:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:07,743 INFO L93 Difference]: Finished difference Result 24579 states and 76915 transitions. [2019-12-27 01:35:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:35:07,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:35:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:07,780 INFO L225 Difference]: With dead ends: 24579 [2019-12-27 01:35:07,781 INFO L226 Difference]: Without dead ends: 19443 [2019-12-27 01:35:07,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:35:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-12-27 01:35:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 11624. [2019-12-27 01:35:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-12-27 01:35:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 36702 transitions. [2019-12-27 01:35:08,065 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 36702 transitions. Word has length 53 [2019-12-27 01:35:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:08,065 INFO L462 AbstractCegarLoop]: Abstraction has 11624 states and 36702 transitions. [2019-12-27 01:35:08,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 36702 transitions. [2019-12-27 01:35:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:08,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:08,083 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 01:35:08,084 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 01:35:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1667433135, now seen corresponding path program 3 times [2019-12-27 01:35:08,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:08,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495898462] [2019-12-27 01:35:08,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:08,173 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 01:35:08,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495898462] [2019-12-27 01:35:08,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:08,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:08,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528743706] [2019-12-27 01:35:08,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:08,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:08,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:08,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:08,175 INFO L87 Difference]: Start difference. First operand 11624 states and 36702 transitions. Second operand 7 states. [2019-12-27 01:35:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:08,589 INFO L93 Difference]: Finished difference Result 29614 states and 91402 transitions. [2019-12-27 01:35:08,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:35:08,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:35:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:08,631 INFO L225 Difference]: With dead ends: 29614 [2019-12-27 01:35:08,631 INFO L226 Difference]: Without dead ends: 21210 [2019-12-27 01:35:08,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:35:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2019-12-27 01:35:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 13657. [2019-12-27 01:35:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-27 01:35:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 42965 transitions. [2019-12-27 01:35:09,179 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 42965 transitions. Word has length 53 [2019-12-27 01:35:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:09,179 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 42965 transitions. [2019-12-27 01:35:09,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 42965 transitions. [2019-12-27 01:35:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:09,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:09,198 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 01:35:09,198 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 01:35:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 750976839, now seen corresponding path program 4 times [2019-12-27 01:35:09,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:09,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752060312] [2019-12-27 01:35:09,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:09,290 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 01:35:09,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752060312] [2019-12-27 01:35:09,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:09,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:35:09,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785584126] [2019-12-27 01:35:09,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:09,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:09,293 INFO L87 Difference]: Start difference. First operand 13657 states and 42965 transitions. Second operand 7 states. [2019-12-27 01:35:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:09,675 INFO L93 Difference]: Finished difference Result 27460 states and 85976 transitions. [2019-12-27 01:35:09,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:35:09,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:35:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:09,714 INFO L225 Difference]: With dead ends: 27460 [2019-12-27 01:35:09,714 INFO L226 Difference]: Without dead ends: 25402 [2019-12-27 01:35:09,714 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 01:35:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25402 states. [2019-12-27 01:35:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25402 to 13726. [2019-12-27 01:35:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13726 states. [2019-12-27 01:35:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 43266 transitions. [2019-12-27 01:35:10,006 INFO L78 Accepts]: Start accepts. Automaton has 13726 states and 43266 transitions. Word has length 53 [2019-12-27 01:35:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:10,006 INFO L462 AbstractCegarLoop]: Abstraction has 13726 states and 43266 transitions. [2019-12-27 01:35:10,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13726 states and 43266 transitions. [2019-12-27 01:35:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:10,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:10,022 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 01:35:10,022 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 01:35:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615376, now seen corresponding path program 1 times [2019-12-27 01:35:10,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:10,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911029629] [2019-12-27 01:35:10,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:10,059 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 01:35:10,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911029629] [2019-12-27 01:35:10,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:10,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:10,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574491957] [2019-12-27 01:35:10,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:10,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:10,061 INFO L87 Difference]: Start difference. First operand 13726 states and 43266 transitions. Second operand 3 states. [2019-12-27 01:35:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:10,186 INFO L93 Difference]: Finished difference Result 18812 states and 59147 transitions. [2019-12-27 01:35:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:10,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:35:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:10,228 INFO L225 Difference]: With dead ends: 18812 [2019-12-27 01:35:10,228 INFO L226 Difference]: Without dead ends: 18812 [2019-12-27 01:35:10,228 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 01:35:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18812 states. [2019-12-27 01:35:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18812 to 16902. [2019-12-27 01:35:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2019-12-27 01:35:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 53223 transitions. [2019-12-27 01:35:10,538 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 53223 transitions. Word has length 53 [2019-12-27 01:35:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:10,538 INFO L462 AbstractCegarLoop]: Abstraction has 16902 states and 53223 transitions. [2019-12-27 01:35:10,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 53223 transitions. [2019-12-27 01:35:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:10,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:10,559 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 01:35:10,559 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 01:35:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2090423977, now seen corresponding path program 5 times [2019-12-27 01:35:10,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:10,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348334070] [2019-12-27 01:35:10,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:10,611 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 01:35:10,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348334070] [2019-12-27 01:35:10,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:10,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:35:10,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474983750] [2019-12-27 01:35:10,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:10,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:10,614 INFO L87 Difference]: Start difference. First operand 16902 states and 53223 transitions. Second operand 3 states. [2019-12-27 01:35:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:10,707 INFO L93 Difference]: Finished difference Result 18773 states and 56435 transitions. [2019-12-27 01:35:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:10,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:35:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:10,730 INFO L225 Difference]: With dead ends: 18773 [2019-12-27 01:35:10,731 INFO L226 Difference]: Without dead ends: 18104 [2019-12-27 01:35:10,731 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 01:35:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-12-27 01:35:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 15749. [2019-12-27 01:35:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15749 states. [2019-12-27 01:35:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15749 states to 15749 states and 47846 transitions. [2019-12-27 01:35:11,227 INFO L78 Accepts]: Start accepts. Automaton has 15749 states and 47846 transitions. Word has length 53 [2019-12-27 01:35:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:11,227 INFO L462 AbstractCegarLoop]: Abstraction has 15749 states and 47846 transitions. [2019-12-27 01:35:11,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 15749 states and 47846 transitions. [2019-12-27 01:35:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:11,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:11,250 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 01:35:11,250 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 01:35:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1578630746, now seen corresponding path program 1 times [2019-12-27 01:35:11,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:11,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277347868] [2019-12-27 01:35:11,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:11,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277347868] [2019-12-27 01:35:11,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:11,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:35:11,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410734436] [2019-12-27 01:35:11,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:35:11,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:35:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:35:11,381 INFO L87 Difference]: Start difference. First operand 15749 states and 47846 transitions. Second operand 7 states. [2019-12-27 01:35:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:12,279 INFO L93 Difference]: Finished difference Result 26751 states and 78312 transitions. [2019-12-27 01:35:12,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:35:12,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:35:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:12,317 INFO L225 Difference]: With dead ends: 26751 [2019-12-27 01:35:12,317 INFO L226 Difference]: Without dead ends: 26641 [2019-12-27 01:35:12,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 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 01:35:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2019-12-27 01:35:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 19681. [2019-12-27 01:35:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-27 01:35:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 59031 transitions. [2019-12-27 01:35:12,701 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 59031 transitions. Word has length 53 [2019-12-27 01:35:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:12,701 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 59031 transitions. [2019-12-27 01:35:12,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:35:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 59031 transitions. [2019-12-27 01:35:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:12,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:12,726 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 01:35:12,726 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 01:35:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash -74918758, now seen corresponding path program 2 times [2019-12-27 01:35:12,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:12,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108556764] [2019-12-27 01:35:12,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:12,831 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 01:35:12,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108556764] [2019-12-27 01:35:12,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:12,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:12,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241639995] [2019-12-27 01:35:12,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:35:12,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:35:12,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:35:12,833 INFO L87 Difference]: Start difference. First operand 19681 states and 59031 transitions. Second operand 8 states. [2019-12-27 01:35:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:14,084 INFO L93 Difference]: Finished difference Result 38250 states and 112084 transitions. [2019-12-27 01:35:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:35:14,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 01:35:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:14,137 INFO L225 Difference]: With dead ends: 38250 [2019-12-27 01:35:14,137 INFO L226 Difference]: Without dead ends: 38140 [2019-12-27 01:35:14,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:35:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38140 states. [2019-12-27 01:35:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38140 to 20676. [2019-12-27 01:35:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20676 states. [2019-12-27 01:35:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20676 states to 20676 states and 61780 transitions. [2019-12-27 01:35:14,847 INFO L78 Accepts]: Start accepts. Automaton has 20676 states and 61780 transitions. Word has length 53 [2019-12-27 01:35:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:14,848 INFO L462 AbstractCegarLoop]: Abstraction has 20676 states and 61780 transitions. [2019-12-27 01:35:14,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:35:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 20676 states and 61780 transitions. [2019-12-27 01:35:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:35:14,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:14,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:14,878 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 01:35:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash 638104790, now seen corresponding path program 3 times [2019-12-27 01:35:14,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:14,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182646499] [2019-12-27 01:35:14,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:14,940 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 01:35:14,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182646499] [2019-12-27 01:35:14,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:14,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:14,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085901118] [2019-12-27 01:35:14,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:14,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:14,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:14,943 INFO L87 Difference]: Start difference. First operand 20676 states and 61780 transitions. Second operand 3 states. [2019-12-27 01:35:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:15,029 INFO L93 Difference]: Finished difference Result 20676 states and 61778 transitions. [2019-12-27 01:35:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:15,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:35:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:15,061 INFO L225 Difference]: With dead ends: 20676 [2019-12-27 01:35:15,061 INFO L226 Difference]: Without dead ends: 20676 [2019-12-27 01:35:15,061 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 01:35:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20676 states. [2019-12-27 01:35:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20676 to 16261. [2019-12-27 01:35:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-12-27 01:35:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 49687 transitions. [2019-12-27 01:35:15,363 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 49687 transitions. Word has length 53 [2019-12-27 01:35:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:15,363 INFO L462 AbstractCegarLoop]: Abstraction has 16261 states and 49687 transitions. [2019-12-27 01:35:15,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 49687 transitions. [2019-12-27 01:35:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 01:35:15,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:15,382 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 01:35:15,382 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 01:35:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -6191814, now seen corresponding path program 1 times [2019-12-27 01:35:15,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:15,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299016017] [2019-12-27 01:35:15,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:15,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 01:35:15,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299016017] [2019-12-27 01:35:15,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:15,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:35:15,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501989094] [2019-12-27 01:35:15,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:35:15,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:35:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:35:15,437 INFO L87 Difference]: Start difference. First operand 16261 states and 49687 transitions. Second operand 3 states. [2019-12-27 01:35:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:15,497 INFO L93 Difference]: Finished difference Result 12476 states and 37450 transitions. [2019-12-27 01:35:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:35:15,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 01:35:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:15,514 INFO L225 Difference]: With dead ends: 12476 [2019-12-27 01:35:15,514 INFO L226 Difference]: Without dead ends: 12476 [2019-12-27 01:35:15,515 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 01:35:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12476 states. [2019-12-27 01:35:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12476 to 11767. [2019-12-27 01:35:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11767 states. [2019-12-27 01:35:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11767 states to 11767 states and 35347 transitions. [2019-12-27 01:35:15,694 INFO L78 Accepts]: Start accepts. Automaton has 11767 states and 35347 transitions. Word has length 54 [2019-12-27 01:35:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:15,694 INFO L462 AbstractCegarLoop]: Abstraction has 11767 states and 35347 transitions. [2019-12-27 01:35:15,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:35:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 11767 states and 35347 transitions. [2019-12-27 01:35:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:15,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:15,707 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 01:35:15,707 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 01:35:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1003034569, now seen corresponding path program 1 times [2019-12-27 01:35:15,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:15,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926774796] [2019-12-27 01:35:15,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:15,794 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 01:35:15,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926774796] [2019-12-27 01:35:15,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:15,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:35:15,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24276861] [2019-12-27 01:35:15,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:35:15,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:15,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:35:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:35:15,797 INFO L87 Difference]: Start difference. First operand 11767 states and 35347 transitions. Second operand 8 states. [2019-12-27 01:35:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:16,874 INFO L93 Difference]: Finished difference Result 22675 states and 67447 transitions. [2019-12-27 01:35:16,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:35:16,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 01:35:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:16,898 INFO L225 Difference]: With dead ends: 22675 [2019-12-27 01:35:16,898 INFO L226 Difference]: Without dead ends: 18316 [2019-12-27 01:35:16,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:35:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18316 states. [2019-12-27 01:35:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18316 to 12308. [2019-12-27 01:35:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-27 01:35:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 36615 transitions. [2019-12-27 01:35:17,339 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 36615 transitions. Word has length 55 [2019-12-27 01:35:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:17,339 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 36615 transitions. [2019-12-27 01:35:17,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:35:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 36615 transitions. [2019-12-27 01:35:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:17,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:17,352 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 01:35:17,352 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 01:35:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash -367516305, now seen corresponding path program 2 times [2019-12-27 01:35:17,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:17,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825833070] [2019-12-27 01:35:17,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:17,481 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 01:35:17,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825833070] [2019-12-27 01:35:17,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:17,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:17,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055812222] [2019-12-27 01:35:17,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:35:17,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:35:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:35:17,484 INFO L87 Difference]: Start difference. First operand 12308 states and 36615 transitions. Second operand 9 states. [2019-12-27 01:35:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:18,530 INFO L93 Difference]: Finished difference Result 21113 states and 62320 transitions. [2019-12-27 01:35:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:35:18,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 01:35:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:18,555 INFO L225 Difference]: With dead ends: 21113 [2019-12-27 01:35:18,556 INFO L226 Difference]: Without dead ends: 17884 [2019-12-27 01:35:18,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:35:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17884 states. [2019-12-27 01:35:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17884 to 12140. [2019-12-27 01:35:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12140 states. [2019-12-27 01:35:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12140 states to 12140 states and 36091 transitions. [2019-12-27 01:35:18,780 INFO L78 Accepts]: Start accepts. Automaton has 12140 states and 36091 transitions. Word has length 55 [2019-12-27 01:35:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:18,780 INFO L462 AbstractCegarLoop]: Abstraction has 12140 states and 36091 transitions. [2019-12-27 01:35:18,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:35:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12140 states and 36091 transitions. [2019-12-27 01:35:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:18,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:18,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:18,795 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 01:35:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1545411663, now seen corresponding path program 3 times [2019-12-27 01:35:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:18,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327874343] [2019-12-27 01:35:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:18,986 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 01:35:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327874343] [2019-12-27 01:35:18,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:18,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186256799] [2019-12-27 01:35:18,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:18,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:18,988 INFO L87 Difference]: Start difference. First operand 12140 states and 36091 transitions. Second operand 10 states. [2019-12-27 01:35:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:19,907 INFO L93 Difference]: Finished difference Result 23095 states and 68048 transitions. [2019-12-27 01:35:19,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:35:19,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 01:35:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:19,935 INFO L225 Difference]: With dead ends: 23095 [2019-12-27 01:35:19,936 INFO L226 Difference]: Without dead ends: 22529 [2019-12-27 01:35:19,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:35:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22529 states. [2019-12-27 01:35:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22529 to 14154. [2019-12-27 01:35:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14154 states. [2019-12-27 01:35:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14154 states to 14154 states and 41743 transitions. [2019-12-27 01:35:20,193 INFO L78 Accepts]: Start accepts. Automaton has 14154 states and 41743 transitions. Word has length 55 [2019-12-27 01:35:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:20,194 INFO L462 AbstractCegarLoop]: Abstraction has 14154 states and 41743 transitions. [2019-12-27 01:35:20,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14154 states and 41743 transitions. [2019-12-27 01:35:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:20,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:20,208 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 01:35:20,208 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 01:35:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1540693839, now seen corresponding path program 4 times [2019-12-27 01:35:20,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:20,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455848591] [2019-12-27 01:35:20,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:20,366 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 01:35:20,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455848591] [2019-12-27 01:35:20,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:20,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:20,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757109069] [2019-12-27 01:35:20,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:20,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:20,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:20,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:20,369 INFO L87 Difference]: Start difference. First operand 14154 states and 41743 transitions. Second operand 10 states. [2019-12-27 01:35:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:21,361 INFO L93 Difference]: Finished difference Result 22861 states and 66856 transitions. [2019-12-27 01:35:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:35:21,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 01:35:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:21,402 INFO L225 Difference]: With dead ends: 22861 [2019-12-27 01:35:21,403 INFO L226 Difference]: Without dead ends: 18912 [2019-12-27 01:35:21,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:35:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18912 states. [2019-12-27 01:35:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18912 to 11980. [2019-12-27 01:35:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11980 states. [2019-12-27 01:35:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11980 states to 11980 states and 35575 transitions. [2019-12-27 01:35:21,835 INFO L78 Accepts]: Start accepts. Automaton has 11980 states and 35575 transitions. Word has length 55 [2019-12-27 01:35:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:21,836 INFO L462 AbstractCegarLoop]: Abstraction has 11980 states and 35575 transitions. [2019-12-27 01:35:21,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11980 states and 35575 transitions. [2019-12-27 01:35:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:21,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:21,856 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 01:35:21,856 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 01:35:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:21,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1318747633, now seen corresponding path program 5 times [2019-12-27 01:35:21,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:21,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110810790] [2019-12-27 01:35:21,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:22,496 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 01:35:22,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110810790] [2019-12-27 01:35:22,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:22,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 01:35:22,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971089101] [2019-12-27 01:35:22,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 01:35:22,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 01:35:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:35:22,498 INFO L87 Difference]: Start difference. First operand 11980 states and 35575 transitions. Second operand 19 states. [2019-12-27 01:35:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:26,633 INFO L93 Difference]: Finished difference Result 19439 states and 56653 transitions. [2019-12-27 01:35:26,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 01:35:26,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-27 01:35:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:26,661 INFO L225 Difference]: With dead ends: 19439 [2019-12-27 01:35:26,661 INFO L226 Difference]: Without dead ends: 18157 [2019-12-27 01:35:26,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 01:35:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18157 states. [2019-12-27 01:35:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18157 to 12148. [2019-12-27 01:35:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12148 states. [2019-12-27 01:35:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12148 states to 12148 states and 35981 transitions. [2019-12-27 01:35:27,171 INFO L78 Accepts]: Start accepts. Automaton has 12148 states and 35981 transitions. Word has length 55 [2019-12-27 01:35:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:27,171 INFO L462 AbstractCegarLoop]: Abstraction has 12148 states and 35981 transitions. [2019-12-27 01:35:27,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 01:35:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 12148 states and 35981 transitions. [2019-12-27 01:35:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:27,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:27,184 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 01:35:27,184 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 01:35:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2097033317, now seen corresponding path program 6 times [2019-12-27 01:35:27,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:27,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140816209] [2019-12-27 01:35:27,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:27,817 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 01:35:27,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140816209] [2019-12-27 01:35:27,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:27,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 01:35:27,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606611233] [2019-12-27 01:35:27,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 01:35:27,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 01:35:27,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:35:27,820 INFO L87 Difference]: Start difference. First operand 12148 states and 35981 transitions. Second operand 16 states. [2019-12-27 01:35:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:31,283 INFO L93 Difference]: Finished difference Result 21890 states and 64061 transitions. [2019-12-27 01:35:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 01:35:31,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 01:35:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:31,311 INFO L225 Difference]: With dead ends: 21890 [2019-12-27 01:35:31,312 INFO L226 Difference]: Without dead ends: 21652 [2019-12-27 01:35:31,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 01:35:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21652 states. [2019-12-27 01:35:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21652 to 12772. [2019-12-27 01:35:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2019-12-27 01:35:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 37633 transitions. [2019-12-27 01:35:31,553 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 37633 transitions. Word has length 55 [2019-12-27 01:35:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:31,553 INFO L462 AbstractCegarLoop]: Abstraction has 12772 states and 37633 transitions. [2019-12-27 01:35:31,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 01:35:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 37633 transitions. [2019-12-27 01:35:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:31,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:31,566 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 01:35:31,566 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 01:35:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2101751141, now seen corresponding path program 7 times [2019-12-27 01:35:31,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:31,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022460995] [2019-12-27 01:35:31,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:31,703 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 01:35:31,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022460995] [2019-12-27 01:35:31,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:31,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:35:31,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188911501] [2019-12-27 01:35:31,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:35:31,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:31,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:35:31,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:35:31,705 INFO L87 Difference]: Start difference. First operand 12772 states and 37633 transitions. Second operand 11 states. [2019-12-27 01:35:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:32,591 INFO L93 Difference]: Finished difference Result 21159 states and 62037 transitions. [2019-12-27 01:35:32,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:35:32,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 01:35:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:32,617 INFO L225 Difference]: With dead ends: 21159 [2019-12-27 01:35:32,617 INFO L226 Difference]: Without dead ends: 18085 [2019-12-27 01:35:32,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:35:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18085 states. [2019-12-27 01:35:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18085 to 11590. [2019-12-27 01:35:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11590 states. [2019-12-27 01:35:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11590 states to 11590 states and 34497 transitions. [2019-12-27 01:35:33,085 INFO L78 Accepts]: Start accepts. Automaton has 11590 states and 34497 transitions. Word has length 55 [2019-12-27 01:35:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:33,085 INFO L462 AbstractCegarLoop]: Abstraction has 11590 states and 34497 transitions. [2019-12-27 01:35:33,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:35:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 11590 states and 34497 transitions. [2019-12-27 01:35:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:33,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:33,097 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 01:35:33,097 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash -767893923, now seen corresponding path program 8 times [2019-12-27 01:35:33,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:33,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215235356] [2019-12-27 01:35:33,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:33,575 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 01:35:33,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215235356] [2019-12-27 01:35:33,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:33,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:35:33,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671223874] [2019-12-27 01:35:33,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:35:33,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:35:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:35:33,577 INFO L87 Difference]: Start difference. First operand 11590 states and 34497 transitions. Second operand 17 states. [2019-12-27 01:35:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:36,664 INFO L93 Difference]: Finished difference Result 20337 states and 59456 transitions. [2019-12-27 01:35:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 01:35:36,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 01:35:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:36,690 INFO L225 Difference]: With dead ends: 20337 [2019-12-27 01:35:36,690 INFO L226 Difference]: Without dead ends: 20141 [2019-12-27 01:35:36,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 01:35:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20141 states. [2019-12-27 01:35:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20141 to 11486. [2019-12-27 01:35:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11486 states. [2019-12-27 01:35:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 34223 transitions. [2019-12-27 01:35:36,905 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 34223 transitions. Word has length 55 [2019-12-27 01:35:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:36,905 INFO L462 AbstractCegarLoop]: Abstraction has 11486 states and 34223 transitions. [2019-12-27 01:35:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:35:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 34223 transitions. [2019-12-27 01:35:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:35:36,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:36,921 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 01:35:36,921 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash -238462213, now seen corresponding path program 9 times [2019-12-27 01:35:36,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:36,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49077802] [2019-12-27 01:35:36,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:35:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:35:37,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:35:37,075 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:35:37,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t412~0.base_40| 1)) (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~__unbuffered_p0_EAX~0_50) (= 0 v_~x$w_buff0~0_407) (= 0 v_~weak$$choice0~0_14) (= v_~__unbuffered_cnt~0_133 0) (= 0 v_~x$w_buff0_used~0_981) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~x$r_buff1_thd1~0_402 0) (= 0 v_~x$w_buff1~0_314) (= v_~x$flush_delayed~0_48 0) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_233) (= 0 v_~x$r_buff0_thd2~0_329) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t412~0.base_40|) |v_ULTIMATE.start_main_~#t412~0.offset_28| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd3~0_134) (= v_~__unbuffered_p1_EAX~0_219 0) (= 0 v_~x$w_buff1_used~0_593) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= v_~x$r_buff0_thd1~0_388 0) (= |v_ULTIMATE.start_main_~#t412~0.offset_28| 0) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_17 0) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t412~0.base_40|) 0) (= |v_#NULL.offset_4| 0) (= v_~weak$$choice2~0_186 0) (= v_~y~0_68 0) (= 0 v_~x$r_buff1_thd3~0_275) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t412~0.base_40|) (= v_~__unbuffered_p2_EBX~0_40 0) (= v_~x$r_buff1_thd0~0_274 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t412~0.base_40| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_407, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_48, ULTIMATE.start_main_~#t412~0.offset=|v_ULTIMATE.start_main_~#t412~0.offset_28|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_402, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_219, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_388, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_275, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_127|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|, ~y~0=v_~y~0_68, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_19|, ULTIMATE.start_main_~#t412~0.base=|v_ULTIMATE.start_main_~#t412~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_329, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_981, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_77|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_186, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_23|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t414~0.base, ~x$flush_delayed~0, ULTIMATE.start_main_~#t412~0.offset, #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, ~__unbuffered_p1_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, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~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_~#t412~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t413~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t414~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, ULTIMATE.start_main_~#t413~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 01:35:37,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L823-1-->L825: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t413~0.base_11|) |v_ULTIMATE.start_main_~#t413~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t413~0.offset_10|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t413~0.base_11| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t413~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t413~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t413~0.base=|v_ULTIMATE.start_main_~#t413~0.base_11|, ULTIMATE.start_main_~#t413~0.offset=|v_ULTIMATE.start_main_~#t413~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t413~0.base, ULTIMATE.start_main_~#t413~0.offset] because there is no mapped edge [2019-12-27 01:35:37,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_~x$w_buff1_used~0_59 v_~x$w_buff0_used~0_123) (= 1 v_~x$w_buff0~0_27) (= v_P1Thread1of1ForFork0_~arg.offset_9 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 1 v_~x$w_buff0_used~0_122) (= 0 (mod v_~x$w_buff1_used~0_59 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|) (= v_P1Thread1of1ForFork0_~arg.base_9 |v_P1Thread1of1ForFork0_#in~arg.base_9|) (= v_~x$w_buff0~0_28 v_~x$w_buff1~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_27, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_11, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_9|, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} 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 01:35:37,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t414~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t414~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t414~0.base_11|) |v_ULTIMATE.start_main_~#t414~0.offset_10| 2))) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t414~0.base_11| 1) |v_#valid_33|) (not (= |v_ULTIMATE.start_main_~#t414~0.base_11| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t414~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t414~0.base=|v_ULTIMATE.start_main_~#t414~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|, ULTIMATE.start_main_~#t414~0.offset=|v_ULTIMATE.start_main_~#t414~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t414~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t414~0.offset] because there is no mapped edge [2019-12-27 01:35:37,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1764873950 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1764873950 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1764873950| ~x~0_In1764873950)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out1764873950| ~x$w_buff1~0_In1764873950)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1764873950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1764873950, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1764873950, ~x~0=~x~0_In1764873950} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1764873950|, ~x$w_buff1~0=~x$w_buff1~0_In1764873950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1764873950, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1764873950, ~x~0=~x~0_In1764873950} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 01:35:37,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1920726891 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1920726891 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1920726891| ~x$w_buff0_used~0_In-1920726891)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1920726891|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1920726891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1920726891} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1920726891, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1920726891|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1920726891} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 01:35:37,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-918594145 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-918594145 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-918594145 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-918594145 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-918594145|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-918594145| ~x$w_buff1_used~0_In-918594145) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-918594145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-918594145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-918594145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-918594145} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-918594145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-918594145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-918594145, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-918594145|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-918594145} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:35:37,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-953452889 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-953452889 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-953452889 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out-953452889 ~x$r_buff0_thd2~0_In-953452889)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-953452889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-953452889} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-953452889|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-953452889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-953452889} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 01:35:37,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1791165242 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1791165242 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1791165242 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1791165242 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1791165242| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1791165242| ~x$r_buff1_thd2~0_In1791165242) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1791165242, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1791165242, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1791165242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791165242} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1791165242|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1791165242, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1791165242, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1791165242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1791165242} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:35:37,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_51 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, 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 01:35:37,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In447714273 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out447714273| |P0Thread1of1ForFork2_#t~ite14_Out447714273|) (= |P0Thread1of1ForFork2_#t~ite14_Out447714273| ~x$w_buff0_used~0_In447714273) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In447714273 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In447714273 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In447714273 256))) (and (= (mod ~x$r_buff1_thd1~0_In447714273 256) 0) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite15_Out447714273| ~x$w_buff0_used~0_In447714273) (= |P0Thread1of1ForFork2_#t~ite14_In447714273| |P0Thread1of1ForFork2_#t~ite14_Out447714273|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In447714273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In447714273, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In447714273, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In447714273|, ~weak$$choice2~0=~weak$$choice2~0_In447714273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In447714273} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In447714273, ~x$w_buff1_used~0=~x$w_buff1_used~0_In447714273, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out447714273|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In447714273, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out447714273|, ~weak$$choice2~0=~weak$$choice2~0_In447714273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In447714273} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:35:37,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L745-->L745-8: Formula: (let ((.cse4 (= |P0Thread1of1ForFork2_#t~ite18_Out1213786458| |P0Thread1of1ForFork2_#t~ite17_Out1213786458|)) (.cse2 (= (mod ~x$w_buff1_used~0_In1213786458 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In1213786458 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1213786458 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1213786458 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1213786458 256) 0))) (or (and (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) .cse4 .cse5 (= ~x$w_buff1_used~0_In1213786458 |P0Thread1of1ForFork2_#t~ite17_Out1213786458|)) (and (not .cse5) (= |P0Thread1of1ForFork2_#t~ite17_In1213786458| |P0Thread1of1ForFork2_#t~ite17_Out1213786458|) (= |P0Thread1of1ForFork2_#t~ite18_Out1213786458| ~x$w_buff1_used~0_In1213786458))) (= |P0Thread1of1ForFork2_#t~ite16_In1213786458| |P0Thread1of1ForFork2_#t~ite16_Out1213786458|)) (let ((.cse6 (not .cse1))) (and (= |P0Thread1of1ForFork2_#t~ite16_Out1213786458| |P0Thread1of1ForFork2_#t~ite17_Out1213786458|) .cse4 (or .cse6 (not .cse2)) .cse5 (= 0 |P0Thread1of1ForFork2_#t~ite16_Out1213786458|) (not .cse0) (or (not .cse3) .cse6))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1213786458, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1213786458|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1213786458, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In1213786458|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1213786458, ~weak$$choice2~0=~weak$$choice2~0_In1213786458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1213786458} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1213786458, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1213786458|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1213786458|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1213786458, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out1213786458|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1213786458, ~weak$$choice2~0=~weak$$choice2~0_In1213786458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1213786458} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 01:35:37,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L745-8-->L747: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite18_55| v_~x$w_buff1_used~0_577) (not (= 0 (mod v_~weak$$choice2~0_176 256))) (= v_~x$r_buff0_thd1~0_373 v_~x$r_buff0_thd1~0_372)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_373, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_55|, ~weak$$choice2~0=v_~weak$$choice2~0_176} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_372, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, P0Thread1of1ForFork2_#t~ite18=|v_P0Thread1of1ForFork2_#t~ite18_54|, P0Thread1of1ForFork2_#t~ite17=|v_P0Thread1of1ForFork2_#t~ite17_48|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, P0Thread1of1ForFork2_#t~ite16=|v_P0Thread1of1ForFork2_#t~ite16_44|, ~weak$$choice2~0=v_~weak$$choice2~0_176, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, ~x$w_buff1_used~0, P0Thread1of1ForFork2_#t~ite16, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 01:35:37,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_36 |v_P2Thread1of1ForFork1_#t~ite32_14|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_14|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_13|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_21|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 01:35:37,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= v_~x$flush_delayed~0_13 0) (not (= (mod v_~x$flush_delayed~0_14 256) 0)) (= v_~x$mem_tmp~0_5 v_~x~0_56) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 01:35:37,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1328913226 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1328913226 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1328913226|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1328913226 |P2Thread1of1ForFork1_#t~ite34_Out1328913226|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1328913226, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328913226} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1328913226|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1328913226, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328913226} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:35:37,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-2093384592 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2093384592 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-2093384592 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-2093384592 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-2093384592| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-2093384592| ~x$w_buff1_used~0_In-2093384592) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2093384592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2093384592, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2093384592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2093384592} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2093384592|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2093384592, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2093384592, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2093384592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2093384592} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:35:37,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-111476354 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-111476354 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-111476354| ~x$r_buff0_thd3~0_In-111476354)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-111476354|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-111476354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111476354} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-111476354|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-111476354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111476354} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:35:37,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In2141836608 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In2141836608 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2141836608 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In2141836608 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In2141836608 |P2Thread1of1ForFork1_#t~ite37_Out2141836608|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out2141836608|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2141836608, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2141836608, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2141836608, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2141836608} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2141836608|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2141836608, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2141836608, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2141836608, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2141836608} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:35:37,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= |v_P2Thread1of1ForFork1_#t~ite37_42| v_~x$r_buff1_thd3~0_144)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, 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 01:35:37,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:35:37,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out696432436| |ULTIMATE.start_main_#t~ite41_Out696432436|)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In696432436 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In696432436 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out696432436| ~x$w_buff1~0_In696432436) (not .cse1) (not .cse2)) (and (= ~x~0_In696432436 |ULTIMATE.start_main_#t~ite41_Out696432436|) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In696432436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In696432436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In696432436, ~x~0=~x~0_In696432436} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out696432436|, ~x$w_buff1~0=~x$w_buff1~0_In696432436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In696432436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In696432436, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out696432436|, ~x~0=~x~0_In696432436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:35:37,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1935803242 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1935803242 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1935803242| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1935803242 |ULTIMATE.start_main_#t~ite43_Out-1935803242|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1935803242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935803242} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1935803242, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1935803242|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1935803242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:35:37,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1169774373 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1169774373 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1169774373 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1169774373 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1169774373| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1169774373 |ULTIMATE.start_main_#t~ite44_Out1169774373|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1169774373, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1169774373, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1169774373, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169774373} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1169774373, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1169774373, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1169774373, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1169774373|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169774373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:35:37,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In710775941 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In710775941 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In710775941 |ULTIMATE.start_main_#t~ite45_Out710775941|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out710775941|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710775941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710775941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In710775941, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out710775941|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In710775941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:35:37,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-753921305 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-753921305 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-753921305 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-753921305 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-753921305| ~x$r_buff1_thd0~0_In-753921305) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-753921305| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-753921305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753921305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-753921305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753921305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-753921305, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-753921305|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753921305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-753921305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753921305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 01:35:37,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EAX~0_205 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite46_45|) (= 0 v_~__unbuffered_p0_EAX~0_34) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_205, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_44|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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 01:35:37,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:35:37 BasicIcfg [2019-12-27 01:35:37,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:35:37,236 INFO L168 Benchmark]: Toolchain (without parser) took 71715.54 ms. Allocated memory was 136.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 99.9 MB in the beginning and 724.2 MB in the end (delta: -624.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,236 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.57 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 155.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.45 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,240 INFO L168 Benchmark]: Boogie Preprocessor took 78.28 ms. Allocated memory is still 200.8 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,241 INFO L168 Benchmark]: RCFGBuilder took 884.02 ms. Allocated memory is still 200.8 MB. Free memory was 149.7 MB in the beginning and 103.4 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,245 INFO L168 Benchmark]: TraceAbstraction took 69836.04 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 102.7 MB in the beginning and 724.2 MB in the end (delta: -621.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 01:35:37,248 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.25 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.57 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.6 MB in the beginning and 155.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.45 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.28 ms. Allocated memory is still 200.8 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.02 ms. Allocated memory is still 200.8 MB. Free memory was 149.7 MB in the beginning and 103.4 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69836.04 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 102.7 MB in the beginning and 724.2 MB in the end (delta: -621.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 165 ProgramPointsBefore, 83 ProgramPointsAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6986 VarBasedMoverChecksPositive, 284 VarBasedMoverChecksNegative, 112 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 75392 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L825] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, 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_p1_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=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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] [L800] 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_p1_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] [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 [L734] 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_p1_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=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=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)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [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_p1_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=7, 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=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=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] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=7, weak$$choice2=1, 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))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [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)) [L747] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=7, weak$$choice2=1, 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))=0, x=1, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [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_p1_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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 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 [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 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_p1_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=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=1, 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_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 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 [L836] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 69.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5668 SDtfs, 7821 SDslu, 22864 SDs, 0 SdLazy, 16236 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 40 SyntacticMatches, 15 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86190occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 146178 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1077 ConstructedInterpolants, 0 QuantifiedInterpolants, 230003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...