/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/mix034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:18:00,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:18:00,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:18:00,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:18:00,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:18:00,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:18:00,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:18:00,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:18:00,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:18:00,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:18:00,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:18:00,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:18:00,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:18:00,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:18:00,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:18:00,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:18:00,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:18:00,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:18:00,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:18:00,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:18:00,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:18:00,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:18:00,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:18:00,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:18:00,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:18:00,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:18:00,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:18:00,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:18:00,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:18:00,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:18:00,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:18:00,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:18:00,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:18:00,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:18:00,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:18:00,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:18:00,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:18:00,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:18:00,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:18:00,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:18:00,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:18:00,334 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 02:18:00,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:18:00,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:18:00,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:18:00,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:18:00,350 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:18:00,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:18:00,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:18:00,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:18:00,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:18:00,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:18:00,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:18:00,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:18:00,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:18:00,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:18:00,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:18:00,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:18:00,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:18:00,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:18:00,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:18:00,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:18:00,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:18:00,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:18:00,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:18:00,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:18:00,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:18:00,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:18:00,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:18:00,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:18:00,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:18:00,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:18:00,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:18:00,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:18:00,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:18:00,686 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:18:00,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-27 02:18:00,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7554ae6/a9083c40b1cf4be68550899d2ce56da4/FLAG08571650c [2019-12-27 02:18:01,299 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:18:01,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-27 02:18:01,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7554ae6/a9083c40b1cf4be68550899d2ce56da4/FLAG08571650c [2019-12-27 02:18:01,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7554ae6/a9083c40b1cf4be68550899d2ce56da4 [2019-12-27 02:18:01,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:18:01,601 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:18:01,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:01,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:18:01,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:18:01,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:01" (1/1) ... [2019-12-27 02:18:01,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:01, skipping insertion in model container [2019-12-27 02:18:01,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:18:01" (1/1) ... [2019-12-27 02:18:01,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:18:01,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:18:02,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:02,170 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:18:02,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:18:02,323 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:18:02,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02 WrapperNode [2019-12-27 02:18:02,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:18:02,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:02,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:18:02,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:18:02,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:18:02,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:18:02,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:18:02,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:18:02,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (1/1) ... [2019-12-27 02:18:02,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:18:02,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:18:02,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:18:02,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:18:02,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (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 02:18:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:18:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:18:02,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:18:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:18:02,514 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:18:02,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:18:02,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:18:02,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:18:02,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:18:02,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:18:02,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:18:02,521 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 02:18:03,260 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:18:03,260 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:18:03,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:03 BoogieIcfgContainer [2019-12-27 02:18:03,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:18:03,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:18:03,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:18:03,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:18:03,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:18:01" (1/3) ... [2019-12-27 02:18:03,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565ee349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:03, skipping insertion in model container [2019-12-27 02:18:03,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:18:02" (2/3) ... [2019-12-27 02:18:03,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565ee349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:18:03, skipping insertion in model container [2019-12-27 02:18:03,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:18:03" (3/3) ... [2019-12-27 02:18:03,271 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-12-27 02:18:03,281 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:18:03,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:18:03,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:18:03,291 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:18:03,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,331 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,416 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,419 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:18:03,438 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:18:03,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:18:03,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:18:03,482 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:18:03,482 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:18:03,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:18:03,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:18:03,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:18:03,483 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:18:03,505 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 02:18:03,506 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 02:18:03,604 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 02:18:03,604 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:03,622 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:18:03,638 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 02:18:03,711 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 02:18:03,711 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:18:03,720 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:18:03,734 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:18:03,736 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:18:08,726 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 02:18:08,841 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 02:18:09,100 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-27 02:18:09,101 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 02:18:09,105 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 02:18:09,598 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-27 02:18:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-27 02:18:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:18:09,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:09,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:18:09,608 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-27 02:18:09,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:09,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336334006] [2019-12-27 02:18:09,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:09,900 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 02:18:09,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336334006] [2019-12-27 02:18:09,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:09,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:18:09,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316730754] [2019-12-27 02:18:09,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:09,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:09,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:09,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:09,925 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-27 02:18:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:10,207 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-27 02:18:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:10,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:18:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:10,297 INFO L225 Difference]: With dead ends: 8598 [2019-12-27 02:18:10,298 INFO L226 Difference]: Without dead ends: 7662 [2019-12-27 02:18:10,299 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 02:18:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-27 02:18:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-27 02:18:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-27 02:18:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-27 02:18:10,826 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-27 02:18:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:10,826 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-27 02:18:10,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-27 02:18:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:18:10,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:10,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:10,831 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-27 02:18:10,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:10,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883984248] [2019-12-27 02:18:10,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:10,893 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 02:18:10,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883984248] [2019-12-27 02:18:10,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:10,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:10,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946741544] [2019-12-27 02:18:10,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:10,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:10,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:10,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:10,897 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-27 02:18:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:10,946 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-27 02:18:10,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:10,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 02:18:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:10,958 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 02:18:10,958 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 02:18:10,960 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 02:18:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 02:18:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 02:18:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 02:18:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-27 02:18:11,010 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-27 02:18:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:11,011 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-27 02:18:11,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-27 02:18:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:18:11,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:11,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:11,021 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-27 02:18:11,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:11,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208994156] [2019-12-27 02:18:11,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:11,115 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 02:18:11,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208994156] [2019-12-27 02:18:11,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:11,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:11,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546669013] [2019-12-27 02:18:11,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:11,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:11,117 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-27 02:18:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:11,201 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-27 02:18:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:11,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 02:18:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:11,215 INFO L225 Difference]: With dead ends: 1943 [2019-12-27 02:18:11,215 INFO L226 Difference]: Without dead ends: 1943 [2019-12-27 02:18:11,215 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 02:18:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-27 02:18:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-27 02:18:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 02:18:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-27 02:18:11,264 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-27 02:18:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:11,265 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-27 02:18:11,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-27 02:18:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:18:11,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:11,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:11,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-27 02:18:11,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:11,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998514591] [2019-12-27 02:18:11,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:11,337 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 02:18:11,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998514591] [2019-12-27 02:18:11,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:11,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:11,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840252326] [2019-12-27 02:18:11,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:11,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:11,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:11,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:11,339 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-27 02:18:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:11,541 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-27 02:18:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:11,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:18:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:11,557 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 02:18:11,557 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 02:18:11,558 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 02:18:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 02:18:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-27 02:18:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-27 02:18:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-27 02:18:11,619 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-27 02:18:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:11,620 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-27 02:18:11,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-27 02:18:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:18:11,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:11,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:11,621 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-27 02:18:11,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:11,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377468100] [2019-12-27 02:18:11,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:11,712 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 02:18:11,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377468100] [2019-12-27 02:18:11,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:11,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:11,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219041915] [2019-12-27 02:18:11,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:11,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:11,715 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-27 02:18:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:11,904 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-27 02:18:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:18:11,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:18:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:11,916 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 02:18:11,917 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 02:18:11,917 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 02:18:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 02:18:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-27 02:18:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-27 02:18:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-27 02:18:11,961 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-27 02:18:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:11,962 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-27 02:18:11,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-27 02:18:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:18:11,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:11,964 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] [2019-12-27 02:18:11,965 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-27 02:18:11,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:11,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530201696] [2019-12-27 02:18:11,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:12,128 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 02:18:12,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530201696] [2019-12-27 02:18:12,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:12,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:12,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748328299] [2019-12-27 02:18:12,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:12,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:12,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:12,133 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-27 02:18:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:12,426 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-27 02:18:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:18:12,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 02:18:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:12,449 INFO L225 Difference]: With dead ends: 2258 [2019-12-27 02:18:12,449 INFO L226 Difference]: Without dead ends: 2258 [2019-12-27 02:18:12,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-27 02:18:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-27 02:18:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-27 02:18:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-27 02:18:12,511 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-27 02:18:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:12,511 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-27 02:18:12,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-27 02:18:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:18:12,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:12,514 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] [2019-12-27 02:18:12,514 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-27 02:18:12,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:12,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179755511] [2019-12-27 02:18:12,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:12,664 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 02:18:12,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179755511] [2019-12-27 02:18:12,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:12,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:18:12,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548915601] [2019-12-27 02:18:12,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:12,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:12,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:12,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:12,667 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-27 02:18:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:12,681 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-27 02:18:12,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:12,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 02:18:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:12,694 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 02:18:12,695 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 02:18:12,695 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 02:18:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 02:18:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-27 02:18:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 02:18:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-27 02:18:12,749 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-27 02:18:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:12,749 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-27 02:18:12,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-27 02:18:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:18:12,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:12,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:12,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-27 02:18:12,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:12,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667125135] [2019-12-27 02:18:12,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:12,883 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 02:18:12,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667125135] [2019-12-27 02:18:12,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:12,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:12,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347164866] [2019-12-27 02:18:12,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:12,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:12,886 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-27 02:18:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:13,125 INFO L93 Difference]: Finished difference Result 2378 states and 5234 transitions. [2019-12-27 02:18:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:18:13,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:18:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:13,132 INFO L225 Difference]: With dead ends: 2378 [2019-12-27 02:18:13,132 INFO L226 Difference]: Without dead ends: 2378 [2019-12-27 02:18:13,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-12-27 02:18:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1851. [2019-12-27 02:18:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-27 02:18:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 4184 transitions. [2019-12-27 02:18:13,190 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 4184 transitions. Word has length 26 [2019-12-27 02:18:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:13,191 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 4184 transitions. [2019-12-27 02:18:13,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 4184 transitions. [2019-12-27 02:18:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:18:13,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:13,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:13,194 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-27 02:18:13,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:13,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140378392] [2019-12-27 02:18:13,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:13,318 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 02:18:13,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140378392] [2019-12-27 02:18:13,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:13,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:18:13,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956369729] [2019-12-27 02:18:13,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:18:13,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:13,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:18:13,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:18:13,322 INFO L87 Difference]: Start difference. First operand 1851 states and 4184 transitions. Second operand 5 states. [2019-12-27 02:18:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:13,833 INFO L93 Difference]: Finished difference Result 2697 states and 5966 transitions. [2019-12-27 02:18:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:18:13,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:18:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:13,846 INFO L225 Difference]: With dead ends: 2697 [2019-12-27 02:18:13,846 INFO L226 Difference]: Without dead ends: 2697 [2019-12-27 02:18:13,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:18:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-12-27 02:18:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2381. [2019-12-27 02:18:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-12-27 02:18:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-12-27 02:18:13,906 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-12-27 02:18:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:13,907 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-12-27 02:18:13,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:18:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-12-27 02:18:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:18:13,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:13,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:13,912 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:13,912 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-27 02:18:13,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:13,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926597209] [2019-12-27 02:18:13,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:13,953 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 02:18:13,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926597209] [2019-12-27 02:18:13,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:13,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:18:13,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119212499] [2019-12-27 02:18:13,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:18:13,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:18:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:18:13,955 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 4 states. [2019-12-27 02:18:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:13,975 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-12-27 02:18:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:18:13,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 02:18:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:13,980 INFO L225 Difference]: With dead ends: 1330 [2019-12-27 02:18:13,980 INFO L226 Difference]: Without dead ends: 1330 [2019-12-27 02:18:13,981 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 02:18:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-12-27 02:18:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-12-27 02:18:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-27 02:18:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-12-27 02:18:14,008 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-12-27 02:18:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:14,008 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-12-27 02:18:14,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:18:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-12-27 02:18:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:18:14,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:14,013 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] [2019-12-27 02:18:14,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-27 02:18:14,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:14,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248357430] [2019-12-27 02:18:14,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:14,103 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 02:18:14,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248357430] [2019-12-27 02:18:14,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:14,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:18:14,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461524517] [2019-12-27 02:18:14,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:18:14,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:18:14,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:18:14,106 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 7 states. [2019-12-27 02:18:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:14,418 INFO L93 Difference]: Finished difference Result 3273 states and 6927 transitions. [2019-12-27 02:18:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:18:14,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 02:18:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:14,427 INFO L225 Difference]: With dead ends: 3273 [2019-12-27 02:18:14,427 INFO L226 Difference]: Without dead ends: 2143 [2019-12-27 02:18:14,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:18:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-27 02:18:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1275. [2019-12-27 02:18:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-27 02:18:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2768 transitions. [2019-12-27 02:18:14,470 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2768 transitions. Word has length 50 [2019-12-27 02:18:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:14,470 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2768 transitions. [2019-12-27 02:18:14,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:18:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2768 transitions. [2019-12-27 02:18:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 02:18:14,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:14,475 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] [2019-12-27 02:18:14,475 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-27 02:18:14,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:14,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045892711] [2019-12-27 02:18:14,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:14,549 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 02:18:14,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045892711] [2019-12-27 02:18:14,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:14,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:14,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804098515] [2019-12-27 02:18:14,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:14,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:14,551 INFO L87 Difference]: Start difference. First operand 1275 states and 2768 transitions. Second operand 3 states. [2019-12-27 02:18:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:14,667 INFO L93 Difference]: Finished difference Result 1629 states and 3493 transitions. [2019-12-27 02:18:14,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:14,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 02:18:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:14,671 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 02:18:14,672 INFO L226 Difference]: Without dead ends: 1629 [2019-12-27 02:18:14,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-27 02:18:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1344. [2019-12-27 02:18:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2019-12-27 02:18:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2924 transitions. [2019-12-27 02:18:14,701 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2924 transitions. Word has length 50 [2019-12-27 02:18:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:14,701 INFO L462 AbstractCegarLoop]: Abstraction has 1344 states and 2924 transitions. [2019-12-27 02:18:14,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2924 transitions. [2019-12-27 02:18:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:18:14,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:14,706 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] [2019-12-27 02:18:14,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:14,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:14,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-27 02:18:14,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:14,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842841005] [2019-12-27 02:18:14,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:14,783 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 02:18:14,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842841005] [2019-12-27 02:18:14,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:14,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:18:14,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893272687] [2019-12-27 02:18:14,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:18:14,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:18:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:18:14,786 INFO L87 Difference]: Start difference. First operand 1344 states and 2924 transitions. Second operand 3 states. [2019-12-27 02:18:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:14,800 INFO L93 Difference]: Finished difference Result 1343 states and 2922 transitions. [2019-12-27 02:18:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:18:14,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:18:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:14,807 INFO L225 Difference]: With dead ends: 1343 [2019-12-27 02:18:14,807 INFO L226 Difference]: Without dead ends: 1343 [2019-12-27 02:18:14,808 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 02:18:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-12-27 02:18:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1122. [2019-12-27 02:18:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-12-27 02:18:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2495 transitions. [2019-12-27 02:18:14,835 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2495 transitions. Word has length 51 [2019-12-27 02:18:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:14,836 INFO L462 AbstractCegarLoop]: Abstraction has 1122 states and 2495 transitions. [2019-12-27 02:18:14,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:18:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2495 transitions. [2019-12-27 02:18:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:18:14,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:14,839 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] [2019-12-27 02:18:14,839 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-27 02:18:14,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:14,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077926061] [2019-12-27 02:18:14,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:14,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:18:14,962 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:18:14,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= (select .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35|) 0) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35|) |v_ULTIMATE.start_main_~#t897~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t897~0.base_35|) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t897~0.base_35| 4)) (= |v_ULTIMATE.start_main_~#t897~0.offset_24| 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t897~0.offset=|v_ULTIMATE.start_main_~#t897~0.offset_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t897~0.base=|v_ULTIMATE.start_main_~#t897~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t898~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t897~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t897~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 02:18:14,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13|) |v_ULTIMATE.start_main_~#t898~0.offset_11| 1))) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t898~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t898~0.base_13|) (= |v_ULTIMATE.start_main_~#t898~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t898~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.base, ULTIMATE.start_main_~#t898~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:18:14,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out940392101) (= P0Thread1of1ForFork0_~arg.base_Out940392101 |P0Thread1of1ForFork0_#in~arg.base_In940392101|) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out940392101|) (= ~z$w_buff0_used~0_In940392101 ~z$w_buff1_used~0_Out940392101) (= (mod ~z$w_buff1_used~0_Out940392101 256) 0) (= ~z$w_buff0~0_Out940392101 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In940392101| P0Thread1of1ForFork0_~arg.offset_Out940392101) (= ~z$w_buff1~0_Out940392101 ~z$w_buff0~0_In940392101) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out940392101| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out940392101)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In940392101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In940392101, ~z$w_buff0~0=~z$w_buff0~0_In940392101, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In940392101|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In940392101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out940392101, ~z$w_buff0~0=~z$w_buff0~0_Out940392101, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out940392101, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out940392101, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In940392101|, ~z$w_buff1~0=~z$w_buff1~0_Out940392101, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out940392101, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out940392101|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out940392101} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:18:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1171416235 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1171416235 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In1171416235 256) 0)) (and .cse0 (= (mod ~z$r_buff1_thd2~0_In1171416235 256) 0)) (= (mod ~z$w_buff0_used~0_In1171416235 256) 0))) .cse1 (= ~z$w_buff1_used~0_In1171416235 |P1Thread1of1ForFork1_#t~ite23_Out1171416235|) (= |P1Thread1of1ForFork1_#t~ite24_Out1171416235| |P1Thread1of1ForFork1_#t~ite23_Out1171416235|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In1171416235| |P1Thread1of1ForFork1_#t~ite23_Out1171416235|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out1171416235| ~z$w_buff1_used~0_In1171416235)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1171416235, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1171416235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1171416235, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1171416235|, ~weak$$choice2~0=~weak$$choice2~0_In1171416235, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1171416235} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1171416235, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1171416235, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1171416235|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1171416235, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1171416235|, ~weak$$choice2~0=~weak$$choice2~0_In1171416235, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1171416235} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 02:18:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 02:18:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:18:14,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1807487966 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1807487966 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1807487966| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1807487966 |P0Thread1of1ForFork0_#t~ite5_Out-1807487966|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1807487966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1807487966} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1807487966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1807487966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1807487966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:18:14,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In128042488 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In128042488 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In128042488 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In128042488 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out128042488|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In128042488 |P0Thread1of1ForFork0_#t~ite6_Out128042488|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In128042488, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In128042488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In128042488, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In128042488} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out128042488|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In128042488, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In128042488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In128042488, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In128042488} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:18:14,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In205446382 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In205446382 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out205446382) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In205446382 ~z$r_buff0_thd1~0_Out205446382) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In205446382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In205446382} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In205446382, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out205446382|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out205446382} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:18:14,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In388520855 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In388520855 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In388520855 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In388520855 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out388520855| ~z$r_buff1_thd1~0_In388520855) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out388520855| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In388520855, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In388520855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388520855, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In388520855} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In388520855, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out388520855|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In388520855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388520855, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In388520855} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:18:14,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-1918218416| |P1Thread1of1ForFork1_#t~ite32_Out-1918218416|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1918218416 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1918218416 256)))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-1918218416 |P1Thread1of1ForFork1_#t~ite32_Out-1918218416|) (not .cse2)) (and (= ~z~0_In-1918218416 |P1Thread1of1ForFork1_#t~ite32_Out-1918218416|) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1918218416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1918218416, ~z$w_buff1~0=~z$w_buff1~0_In-1918218416, ~z~0=~z~0_In-1918218416} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1918218416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1918218416, ~z$w_buff1~0=~z$w_buff1~0_In-1918218416, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1918218416|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1918218416|, ~z~0=~z~0_In-1918218416} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:18:14,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In912633203 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In912633203 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out912633203| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out912633203| ~z$w_buff0_used~0_In912633203)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In912633203, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In912633203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In912633203, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out912633203|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In912633203} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:18:14,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2127355616 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2127355616 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2127355616 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In2127355616 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2127355616|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out2127355616| ~z$w_buff1_used~0_In2127355616) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2127355616, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2127355616, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2127355616, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2127355616} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2127355616, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2127355616, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2127355616, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2127355616|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2127355616} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:18:14,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1206105245 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1206105245 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1206105245 |P1Thread1of1ForFork1_#t~ite36_Out1206105245|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1206105245|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1206105245, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1206105245} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1206105245, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1206105245, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1206105245|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:18:14,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1723175991 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1723175991 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1723175991 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1723175991 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1723175991 |P1Thread1of1ForFork1_#t~ite37_Out1723175991|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1723175991|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1723175991, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1723175991, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1723175991, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1723175991} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1723175991, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1723175991, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1723175991, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1723175991, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1723175991|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:18:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:18:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:18:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 02:18:14,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1187961366 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1187961366 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1187961366 |ULTIMATE.start_main_#t~ite40_Out-1187961366|)) (and (= ~z~0_In-1187961366 |ULTIMATE.start_main_#t~ite40_Out-1187961366|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1187961366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1187961366, ~z$w_buff1~0=~z$w_buff1~0_In-1187961366, ~z~0=~z~0_In-1187961366} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1187961366|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1187961366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1187961366, ~z$w_buff1~0=~z$w_buff1~0_In-1187961366, ~z~0=~z~0_In-1187961366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:18:14,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 02:18:14,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1046739776 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1046739776 256)))) (or (and (= ~z$w_buff0_used~0_In-1046739776 |ULTIMATE.start_main_#t~ite42_Out-1046739776|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1046739776|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1046739776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1046739776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1046739776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1046739776, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1046739776|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:18:14,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-367932884 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-367932884 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-367932884 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-367932884 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-367932884| ~z$w_buff1_used~0_In-367932884)) (and (= |ULTIMATE.start_main_#t~ite43_Out-367932884| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367932884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367932884, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367932884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367932884} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367932884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-367932884, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-367932884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-367932884, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-367932884|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:18:14,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1093855965 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1093855965 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1093855965|)) (and (= ~z$r_buff0_thd0~0_In1093855965 |ULTIMATE.start_main_#t~ite44_Out1093855965|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1093855965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1093855965} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1093855965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1093855965, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1093855965|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:18:14,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-668116693 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-668116693 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-668116693 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-668116693 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-668116693|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-668116693 |ULTIMATE.start_main_#t~ite45_Out-668116693|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-668116693, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668116693, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-668116693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668116693} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-668116693, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-668116693, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-668116693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668116693, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-668116693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:18:14,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:18:15,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:18:15 BasicIcfg [2019-12-27 02:18:15,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:18:15,084 INFO L168 Benchmark]: Toolchain (without parser) took 13483.69 ms. Allocated memory was 135.3 MB in the beginning and 446.2 MB in the end (delta: 310.9 MB). Free memory was 98.0 MB in the beginning and 271.2 MB in the end (delta: -173.2 MB). Peak memory consumption was 137.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,088 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.03 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 153.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.02 ms. Allocated memory is still 199.2 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,094 INFO L168 Benchmark]: Boogie Preprocessor took 35.19 ms. Allocated memory is still 199.2 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,095 INFO L168 Benchmark]: RCFGBuilder took 831.35 ms. Allocated memory is still 199.2 MB. Free memory was 148.4 MB in the beginning and 104.0 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,095 INFO L168 Benchmark]: TraceAbstraction took 11819.28 ms. Allocated memory was 199.2 MB in the beginning and 446.2 MB in the end (delta: 246.9 MB). Free memory was 103.3 MB in the beginning and 271.2 MB in the end (delta: -167.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:15,103 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.49 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.03 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 153.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.02 ms. Allocated memory is still 199.2 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.19 ms. Allocated memory is still 199.2 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.35 ms. Allocated memory is still 199.2 MB. Free memory was 148.4 MB in the beginning and 104.0 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11819.28 ms. Allocated memory was 199.2 MB in the beginning and 446.2 MB in the end (delta: 246.9 MB). Free memory was 103.3 MB in the beginning and 271.2 MB in the end (delta: -167.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1638 SDtfs, 1137 SDslu, 2833 SDs, 0 SdLazy, 1318 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred 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: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 3470 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 35075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...